Jay B. Ghosh

29 papers Misc 2Journal 25Unranked 2
YearRankTypeTitle / Venue / Authors
2011 J jnl
Minimizing weighted mean absolute deviation of job completion times from their weighted mean.
Appl. Math. Comput.
Erdal Erel, Jay B. Ghosh
2008 J jnl
FPTAS for half-products minimization with scheduling applications.
Discret. Appl. Math.
Erdal Erel, Jay B. Ghosh
2007 J jnl
Batch scheduling to minimize the weighted number of tardy jobs.
Comput. Ind. Eng.
Erdal Erel, Jay B. Ghosh
2007 J jnl
Customer order scheduling on a single machine with family setup times: Complexity and algorithms.
Appl. Math. Comput.
Erdal Erel, Jay B. Ghosh
2007 J jnl
Market- and Merit-Based Adjustment of faculty Salaries.
Asia Pac. J. Oper. Res.
P. Sunil Dharmapala, Jay B. Ghosh, Hussein M. Saber
2007 J jnl
Scheduling with tool changes to minimize total completion time under controllable machining conditions.
Comput. Oper. Res.
M. Selim Akturk, Jay B. Ghosh, Rabia K. Kayan
2005 J jnl
Maximum diversity/similarity models with extension to part grouping.
Int. Trans. Oper. Res.
Gajendra Kumar Adil, Jay B. Ghosh
2005 J jnl
New heuristic for the dynamic layout problem.
J. Oper. Res. Soc.
Erdal Erel, Jay B. Ghosh, J. T. Simon
2004 J jnl
Scheduling with tool changes to minimize total completion time: Basic results and SPT performance.
Eur. J. Oper. Res.
M. Selim Akturk, Jay B. Ghosh, Evrim D. Günes
2003 J jnl
New heuristic for the dynamic layout problem.
J. Oper. Res. Soc.
Erdal Erel, Jay B. Ghosh, J. T. Simon
1999 J jnl
Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem.
Oper. Res.
Gajendra Kumar Adil, Jay B. Ghosh
1997 J jnl
Batch scheduling to minimize maximum lateness.
Oper. Res. Lett.
Jay B. Ghosh, Jatinder N. D. Gupta
1997 J jnl
Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks.
Oper. Res.
Prabuddha De, E. James Dunne, Jay B. Ghosh, Charles E. Wells
1997 J jnl
Job selection in a heavily loaded shop.
Comput. Oper. Res.
Jay B. Ghosh
1996 J jnl
Computational aspects of the maximum diversity problem.
Oper. Res. Lett.
Jay B. Ghosh
1994 J jnl
Batch scheduling to minimize total completion time.
Oper. Res. Lett.
Jay B. Ghosh
1993 J jnl
Delivery time quotation and order processing with forbidden early shipments.
Comput. Oper. Res.
Prabuddha De, Jay B. Ghosh, Charles E. Wells
1993 J jnl
On the general solution for a class of early/tardy problems.
Comput. Oper. Res.
Prabuddha De, Jay B. Ghosh, Charles E. Wells
1992 J jnl
On the Minimization of Completion Time Variance with a Bicriteria Extension.
Oper. Res.
Prabuddha De, Jay B. Ghosh, Charles E. Wells
1991 J jnl
On the minimization of the weighted number of tardy jobs with random processing times and deadline.
Comput. Oper. Res.
Prabuddha De, Jay B. Ghosh, Charles E. Wells
1991 J jnl
Scheduling to minimize weighted earliness and tardiness about a common due-date.
Comput. Oper. Res.
Prabuddha De, Jay B. Ghosh, Charles E. Wells
1991 J jnl
Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine.
Comput. Oper. Res.
Prabuddha De, Jay B. Ghosh, Charles E. Wells
1990 J jnl
CON due-date determination and sequencing.
Comput. Oper. Res.
Prabuddha De, Jay B. Ghosh, Charles E. Wells
1990 J jnl
Scheduling about a common due date with earliness and tardiness penalties.
Comput. Oper. Res.
Prabuddha De, Jay B. Ghosh, Charles E. Wells
1988 J jnl
Evaluating multiprocessor performance: an exercise in metamodeling.
Simul.
Jay B. Ghosh
1986 — conf
Performance evaluation of interconnection networks in multiprocessor systems.
ANSS
Nizar Al-Holou, Jay B. Ghosh, Dana B. Rogers
1985 — conf
Asynchronous control of discrete event simulation.
ANSS
Jay B. Ghosh
1985 Misc conf
General simulation of multiprocessor interconnection networks.
WSC
Nizar Al-Holou, Jay B. Ghosh, Dana B. Rogers
1984 Misc conf
Asynchronous simulation of some discrete time models.
WSC
Jay B. Ghosh