J. B. Ghosh

发表

Solving a generalized model for CON due date assignment and sequencing

P. De, J. B. Ghosh, C. E. Wells, 1994 .

Note-A Note on the Minimization of Mean Squared Deviation of Completion Times About a Common Due Date

P. De, J. B. Ghosh, C. E. Wells, 1989 .

Expectation-variance analyss of job sequences under processing time uncertainty

P. De, J. B. Ghosh, C. E. Wells, 1992 .

Siting Facilities along a Line when Equity of Service is Desirable

J. B. Ghosh, 1996 .

Due‐date assignment and early/tardy scheduling on identical parallel machines

P. De, J. B. Ghosh, C. E. Wells, 1994 .

Optimal due-date assignment and sequencing

P. De, J. B. Ghosh, C. E. Wells, 1992 .

Determining optimal redundancy for systems with random lifetimes

J. B. Ghosh, C. E. Wells, 1990 .

Coordinating new product development and delivery

P. De, J. B. Ghosh, C. E. Wells, 1991 .

Asynchronous control of discrete event simulation

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

Asynchronous simulation of some discrete time models

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

Performance evaluation of interconnection networks in multiprocessor systems

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

Job selection in a heavily loaded shop

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

Optimal Delivery Time Quotation and Order Sequencing

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

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

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

Computational aspects of the maximum diversity problem

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

The discrete time-cost tradeoff problem revisited

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

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

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

On the Minimization of Completion Time Variance with a Bicriteria Extension

Prabuddha De, Jay B. Ghosh, Charles E. Wells, 1992, 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..

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..

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 .

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..

Lagrangian solution of maximum dispersion problems

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

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

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

Batch scheduling to minimize maximum lateness

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

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..

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..

Scheduling to minimize the coefficient of variation

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

Optimal retrieval strategies for carousel conveyors

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

CON due-date determination and sequencing

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