Minimizing makespan in an ordered flow shop with machine-dependent processing times

Authors

Byung Cheon Choi, Chungnam National University
Joseph Y.T. Leung, Department of Computer Science
Michael L. Pinedo, Leonard N. Stern School of Business

Document Type

Article

Publication Date

11-1-2011

Abstract

We consider a generalization of the proportionate flow shop problem with the makespan objective. Each job has a processing requirement and each machine has a characteristic value. In our case, we assume that the time a job occupies a machine is equal to the processing requirement of the job plus a setup time that is equal to the characteristic value of that machine. In this paper, we consider permutation schedules and show that the problem is solvable in polynomial time when the number of machines is fixed. © 2010 Springer Science+Business Media, LLC.

Identifier

83555172646 (Scopus)

Publication Title

Journal of Combinatorial Optimization

External Full Text Location

https://doi.org/10.1007/s10878-010-9330-x

e-ISSN

15732886

ISSN

13826905

First Page

797

Last Page

818

Issue

4

Volume

22

Grant

0556010

Fund Ref

National Science Foundation

Recommended Citation

Choi, Byung Cheon; Leung, Joseph Y.T.; and Pinedo, Michael L., "Minimizing makespan in an ordered flow shop with machine-dependent processing times" (2011). Faculty Publications. 11117.
https://digitalcommons.njit.edu/fac_pubs/11117