TY - JOUR
T1 - A note on makespan minimization in proportionate flow shops
AU - Choi, Byung Cheon
AU - Leung, Joseph Y.T.
AU - Pinedo, Michael L.
N1 - Funding Information:
E-mail addresses: [email protected] (B.-C. Choi), [email protected] (J.Y.-T. Leung), [email protected] (M.L. Pinedo). 1 Work supported by the Korea Research Foundation Grant KRF-2008-357-D00289. 2 Work supported in part by the NSF Grant CMMI-0969830. 3 Work supported in part by the NSF Grant CMMI-0969755.
PY - 2010/12/31
Y1 - 2010/12/31
N2 - A study was conducted to demonstrate the process of makespan minimization in proportionate flow shops. The objective was to find a sequence for the n jobs that minimized the makespan, denoted by Cmax. It was assumed that job j had a processing requirement pj that affected the time job j spends on each one of the m machines. It was assumed that machine i had a characteristic value qi that affected the time each job spends on machine i. Models were considered where the time job j spends on machine i, pij was a given function of pj and qi. These models were regarded as proportionate flow shops with processing times that were machine dependent. It was demonstrated that the processing times of job j on all m machines were equal to pj in the proportionate flow shop environment. The proportionate flow shop model was also generalized by describing the processing time on each machine as a function of a processing requirement and a machine-dependent parameter.
AB - A study was conducted to demonstrate the process of makespan minimization in proportionate flow shops. The objective was to find a sequence for the n jobs that minimized the makespan, denoted by Cmax. It was assumed that job j had a processing requirement pj that affected the time job j spends on each one of the m machines. It was assumed that machine i had a characteristic value qi that affected the time each job spends on machine i. Models were considered where the time job j spends on machine i, pij was a given function of pj and qi. These models were regarded as proportionate flow shops with processing times that were machine dependent. It was demonstrated that the processing times of job j on all m machines were equal to pj in the proportionate flow shop environment. The proportionate flow shop model was also generalized by describing the processing time on each machine as a function of a processing requirement and a machine-dependent parameter.
KW - Combinatorial problems
UR - http://www.scopus.com/inward/record.url?scp=78149351078&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=78149351078&partnerID=8YFLogxK
U2 - 10.1016/j.ipl.2010.10.016
DO - 10.1016/j.ipl.2010.10.016
M3 - Article
AN - SCOPUS:78149351078
SN - 0020-0190
VL - 111
SP - 77
EP - 81
JO - Information Processing Letters
JF - Information Processing Letters
IS - 2
ER -