Jay B. Ghosh

发表

Job selection and sequencing on a single machine in a random environment

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1993 .

Scheduling about a common due date with earliness and tardiness penalties

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1990, Comput. Oper. Res..

Assigning students to academic majors

Jay B. Ghosh, Hussein M. Saber, 2001 .

Batch scheduling to minimize total completion time

Jay B. Ghosh, 1994, Oper. Res. Lett..

CON due-date determination and sequencing

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1990, Comput. Oper. Res..

Scheduling with tool changes to minimize total completion time: Basic results and SPT performance

Jay B. Ghosh, M. Selim Akturk, Evrim Didem Günes, 2004, Eur. J. Oper. Res..

Asynchronous control of discrete event simulation

Jay B. Ghosh, J. B. Ghosh, 1985, ANSS '85.

Customer order scheduling on a single machine with family setup times: Complexity and algorithms

Jay B. Ghosh, Erdal Erel, J. B. Ghosh, 2007, Appl. Math. Comput..

The discrete time-cost tradeoff problem revisited

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1995 .

New heuristic for the dynamic layout problem

Jay B. Ghosh, Erdal Erel, J. T. Simon, 2003, J. Oper. Res. Soc..

On the general solution for a class of early/tardy problems

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1993, Comput. Oper. Res..

Computational aspects of the maximum diversity problem

Jay B. Ghosh, J. B. Ghosh, 1996, Oper. Res. Lett..

Job selection in a heavily loaded shop

Jay B. Ghosh, J. B. Ghosh, 1997, Comput. Oper. Res..

Performance evaluation of interconnection networks in multiprocessor systems

Jay B. Ghosh, Dana B. Rogers, D. B. Rogers, 1986, ANSS '86.

Delivery time quotation and order processing with forbidden early shipments

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1993, Comput. Oper. Res..

Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1991, Comput. Oper. Res..

Heuristic Estimation of the Efficient Frontier for a Bi‐Criteria Scheduling Problem

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1992 .

Optimal Delivery Time Quotation and Order Sequencing

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1991 .

On the Multiple-machine Extension to a Common Due-date Assignment and Scheduling Problem

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1991 .

Batch scheduling to minimize maximum lateness

Jatinder N. D. Gupta, Jay B. Ghosh, J. B. Ghosh, 1997, Oper. Res. Lett..

Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1997, Oper. Res..

Erratum: New heuristic for the dynamic layout problem

Jay B. Ghosh, Erdal Erel, J. T. Simon, 2005, J. Oper. Res. Soc..

Optimal retrieval strategies for carousel conveyors

Jay B. Ghosh, Charles E. Wells, J. B. Ghosh, 1992 .

Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance

Jay B. Ghosh, M. Selim Akturk, M. S. Akturk, 2003 .

Evaluating multiprocessor performance: an exercise in metamodeling

Jay B. Ghosh, 1988, Simul..

Maximum diversity/similarity models with extension to part grouping

Jay B. Ghosh, Gajendra Kumar Adil, 2005, Int. Trans. Oper. Res..

On the Minimization of Completion Time Variance with a Bicriteria Extension

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1992, Oper. Res..

Asynchronous simulation of some discrete time models

Jay B. Ghosh, J. B. Ghosh, 1984, WSC '84.

Analysis of Lagrangian Lower Bounds for a Graph Partitioning Problem

Jay B. Ghosh, Gajendra Kumar Adil, 1999, Oper. Res..

Scheduling to minimize the coefficient of variation

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1996 .

General simulation of multiprocessor interconnection networks

Jay B. Ghosh, Nizar Al-Holou, Dana B. Rogers, 1985, WSC '85.

Scheduling with tool changes to minimize total completion time under controllable machining conditions

Jay B. Ghosh, M. Selim Akturk, M. S. Akturk, 2007, Comput. Oper. Res..

Batch scheduling to minimize the weighted number of tardy jobs

Jay B. Ghosh, Erdal Erel, 2007, Comput. Ind. Eng..

Market- and Merit-Based Adjustment of faculty Salaries

Jay B. Ghosh, Hussein M. Saber, P. Sunil Dharmapala, 2007, Asia Pac. J. Oper. Res..

Scheduling to minimize weighted earliness and tardiness about a common due-date

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1991, Comput. Oper. Res..

Minimizing weighted mean absolute deviation of job completion times from their weighted mean

Jay B. Ghosh, Erdal Erel, 2011, Appl. Math. Comput..

On the minimization of the weighted number of tardy jobs with random processing times and deadline

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1991, Comput. Oper. Res..

Forming GT cells incrementally using GRASP

Gajendra K. Adil, Jay B. Ghosh, 2005 .

FPTAS for half-products minimization with scheduling applications

Jay B. Ghosh, Erdal Erel, 2008, Discret. Appl. Math..

On the solution of a stochastic bottleneck assignment problem and its variations

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1992 .

ISO 9000 implementation in Turkish industry

Jay B. Ghosh, Erdal Erel, 1997 .

Lagrangian solution of maximum dispersion problems

Burak Eksioglu, Jay B. Ghosh, J. B. Ghosh, 2000 .