Asynchronous simulation of some discrete time models. - Jay B. Ghosh (WSC, 1984)

Asynchronous control of discrete event simulation. - Jay B. Ghosh (ANSS, 1985)

General simulation of multiprocessor interconnection networks. - Nizar Al-Holou; Jay B. Ghosh; Dana B. Rogers (WSC, 1985)

Performance evaluation of interconnection networks in multiprocessor systems. - Nizar Al-Holou; Jay B. Ghosh; Dana B. Rogers (ANSS, 1986)

Evaluating multiprocessor performance: an exercise in metamodeling. - Jay B. Ghosh (Simul., 1988)

Scheduling about a common due date with earliness and tardiness penalties. - Prabuddha De; Jay B. Ghosh; Charles E. Wells (Comput. Oper. Res., 1990)

CON due-date determination and sequencing. - Prabuddha De; Jay B. Ghosh; Charles E. Wells (Comput. Oper. Res., 1990)

On the minimization of the weighted number of tardy jobs with random processing times and deadline. - Prabuddha De; Jay B. Ghosh; Charles E. Wells (Comput. Oper. Res., 1991)

Scheduling to minimize weighted earliness and tardiness about a common due-date. - Prabuddha De; Jay B. Ghosh; Charles E. Wells (Comput. Oper. Res., 1991)

Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine. - Prabuddha De; Jay B. Ghosh; Charles E. Wells (Comput. Oper. Res., 1991)

On the Minimization of Completion Time Variance with a Bicriteria Extension. - Prabuddha De; Jay B. Ghosh; Charles E. Wells (Oper. Res., 1992)

On the general solution for a class of early/tardy problems. - Prabuddha De; Jay B. Ghosh; Charles E. Wells (Comput. Oper. Res., 1993)

Delivery time quotation and order processing with forbidden early shipments. - Prabuddha De; Jay B. Ghosh; Charles E. Wells (Comput. Oper. Res., 1993)

Batch scheduling to minimize total completion time. - Jay B. Ghosh (Oper. Res. Lett., 1994)

Computational aspects of the maximum diversity problem. - Jay B. Ghosh (Oper. Res. Lett., 1996)

Job selection in a heavily loaded shop. - Jay B. Ghosh (Comput. Oper. Res., 1997)

Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks. - Prabuddha De; E. James Dunne; Jay B. Ghosh; Charles E. Wells (Oper. Res., 1997)

Batch scheduling to minimize maximum lateness. - Jay B. Ghosh; Jatinder N. D. Gupta (Oper. Res. Lett., 1997)

Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem. - Gajendra Kumar Adil; Jay B. Ghosh (Oper. Res., 1999)

Scheduling with tool changes to minimize total completion time: Basic results and SPT performance. - M. Selim Akturk; Jay B. Ghosh; Evrim D. Günes (Eur. J. Oper. Res., 2004)

Maximum diversity/similarity models with extension to part grouping. - Gajendra Kumar Adil; Jay B. Ghosh (Int. Trans. Oper. Res., 2005)

New heuristic for the dynamic layout problem. - Erdal Erel; Jay B. Ghosh; J. T. Simon (J. Oper. Res. Soc., 2005)

Customer order scheduling on a single machine with family setup times: Complexity and algorithms. - Erdal Erel; Jay B. Ghosh (Appl. Math. Comput., 2007)

Market- and Merit-Based Adjustment of faculty Salaries. - P. Sunil Dharmapala; Jay B. Ghosh; Hussein M. Saber (Asia Pac. J. Oper. Res., 2007)

Batch scheduling to minimize the weighted number of tardy jobs. - Erdal Erel; Jay B. Ghosh (Comput. Ind. Eng., 2007)

Scheduling with tool changes to minimize total completion time under controllable machining conditions. - M. Selim Akturk; Jay B. Ghosh; Rabia K. Kayan (Comput. Oper. Res., 2007)

FPTAS for half-products minimization with scheduling applications. - Erdal Erel; Jay B. Ghosh (Discret. Appl. Math., 2008)

Minimizing weighted mean absolute deviation of job completion times from their weighted mean. - Erdal Erel; Jay B. Ghosh (Appl. Math. Comput., 2011)