Abstract
Conventionally, job processing times are assumed to be constant from the first job to be processed until the last job to be completed. However, recent empirical studies in several industries have verified that unit costs decline as firms produce more of a product and gain knowledge or experience. This phenomenon is known as the “learning effect.” In this paper a bicriteria m-identical parallel machine scheduling problem with a learning effect is considered. The objective function of the problem is to find a sequence that minimizes a weighted sum of total completion time and total tardiness. Total completion time and total tardiness are widely used performance measures in scheduling literature. To solve this scheduling problem, a mathematical programming model is formulated.
Similar content being viewed by others
References
Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173–178
Mosheiov G (2001) Scheduling problems with a learning effect. Eur J Oper Res 132:687–693
Mosheiov G (2001) Parallel machine scheduling with a learning effect. J Oper Res Soc 52:1165–1169
Lee WC, Wu CC, Sung HJ (2004) A bi-criterion single machine scheduling problem with learning considerations. Acta Inform 40:303–315
Lee WC, Wu CC (2004) Minimizing total completion time in a two-machine flowshop with a learning effect. Int J Prod Econ 88:85–93
Mosheiov G, Sidney J (2003) Scheduling with general job-dependent learning curves. Eur J Oper Res 147:665–670
Eren T, Güner E (2007) Minimizing total tardiness in a scheduling problem with a learning effect. Appl Math Model 31(7):1351–1361
Wu CC, Lee WC, Wang WC (2007) A two-machine flowshop maximum tardiness scheduling problem with a learning effect. Int J Adv Manuf Technol 31:743–750
Eren T, Güner E (in print) A bicriteria scheduling with a learning effect: total completion time and total tardiness. Infor
Lee WC, Wu CC (2004) Minimizing total completion time in a two-machine flowshop with a learning effect. Int J Prod Econ 88:85–93
Eren T, Güner E (2004) Minimizing mean flow time in a flowshop scheduling with learning effect. Journal of the Faculty of Engineering and Architecture of Gazi University 19:119–124. (In Turkish)
Eren T, Güner E (in print) A bicriteria flowshop scheduling with a learning effect. Appl Math Model
Du J, Leung JYT (1990) Minimizing total tardiness on one machine is NP-hard. Math Oper Res 15:483–495
Hsu YS, Lin BNT (2003) Minimizing of maximum lateness under linear deterioration. Omega 31:459–469
Heizer J, Render B (2001) Operations management, sixth edn. Prentice-Hall, Upper Saddle River
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Eren, T., Güner, E. A bicriteria parallel machine scheduling with a learning effect. Int J Adv Manuf Technol 40, 1202–1205 (2009). https://doi.org/10.1007/s00170-008-1436-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-008-1436-2