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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja RK, Mehlhorn K, Orlin JB, Tarjan RE (1996) Faster algorithms for the shortest path problem. J Assoc Comput Mach 37:213–223
Allahverdi A (1996) Two-machine proportionate flowshop scheduling with breakdown to minimize maximum lateness. Comput Oper Res 23:909–916
Biskup D (2008) A state-of-the-art review on scheduling with learning effects. Eur J Oper Res 188:315–329
Cheng TCE, Gupta JND, Wang G (2000) A review of flowshop-scheduling research with set-up times. Prod Oper Manag 9:262–282
Choi BC, Yoon SH, Chung SJ (2007) Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. Eur J Oper Res 176:964–974
Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1:117–129
Gawiejnowicz S (2008) Time-dependent scheduling. Springer, Berlin
Graham RL (1972) An efficient algorithm for determining the convex hull of a finite planar set. Inf Process Lett 1:132–133
Hejazi SR, Saghafian S (2005) Flowshop-scheduling problems with makespan criterion: a review. Int J Prod Res 43:2895–2929
Hoogeveen JA, Kawaguchi T (1999) Minimizing total completion time in a two-machine flowshop: analysis of special cases. Math Oper Res 24:887–910
Hou S, Hoogeveen H (2003) The three-machine proportionate flow shop with unequal machine speeds. Oper Res Lett 31:225–231
Johnson SM (1954) Optimal two- and three-stage production schedules with setup times included. Nav Res Logist Q 1:62–67
Koulamas C, Kyparisis GJ (2009) A note on the proportional flow shop with a bottleneck machine. Eur J Oper Res 193:644–645
Ow PS (1985) Focused scheduling in proportionate flow shops. Manag Sci 31:851–869
Panwalkar SS, Khan AW (1976) An ordered flow shop sequencing problem with mean completion time criterion. Int J Prod Res 14:631–635
Panwalkar SS, Woollam CR (1980) Ordered flow shop problems with no in-process waiting: future results. J Oper Res Soc 31:1039–1043
Pinedo M (2002) Scheduling: theory, algorithms and systems, 2nd edn. Prentice-Hall, New York
Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discrete Appl Math 155:1643–1666
Shakhlevich N, Hoogeveen H, Pinedo M (1998) Minimizing total weighted completion time in a proportionate flow shop. J Sched 1:157–168
Smith ML, Panwalkar SS, Dudek RA (1975) Flow shop sequencing problem with ordered processing time matrices. Manag Sci 21:544–549
Smith ML, Panwalkar SS, Dudek RA (1976) Flow shop sequencing problem with ordered processing time matrices: a general case. Nav Res Logist Q 23:481–486
Author information
Authors and Affiliations
Corresponding author
Additional information
B.-C. Choi was supported by the Korea Research Foundation Grant KRF-2008-357-D00289.
J.Y.-T. Leung was supported in part by the NSF Grant DMI-0556010.
M.L. Pinedo was supported in part by the NSF Grant DMI-0555999.
Rights and permissions
About this article
Cite this article
Choi, BC., Leung, J.YT. & Pinedo, M.L. Minimizing makespan in an ordered flow shop with machine-dependent processing times. J Comb Optim 22, 797–818 (2011). https://doi.org/10.1007/s10878-010-9330-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-010-9330-x