基于加工时间之和学习效应下的单机成组排序问题

Abstract

Abstract: This paper investigates a new group scheduling problem with sum-of-processing-time based learning effect. The learning effect of a job is assumed to be a function of total processing times of jobs scheduled in front of it, the learning effect of group is assumed to a function of its position in the sequence. The goal is to minimize makespan and the total completion times under the proposed model, respectively. Some optimal properties and optimal polynomial time algorithms to solve these problems are also provided.

Key words: single-machine, learning effect, group technology, makespan, total completion time

ZHANG Xingong. Single-machine group scheduling problems with the sum-of-processing-time based on learning effect[J]. Operations Research Transactions, 2013, 17(1): 98-105.

References

Heiser J, Render B. Operations Management [M]. Prentice Hall: Englewood Cliffs, NJ, 1999.
Russell R, Taylor B W III. Operations Management: Multimedia Version [M]. Prentice Hall: Upper Saddle River, NJ, 2000.
Biskup D. Single-machines scheduling with learning considerations [J]. European of Journal Operation Research, 1999, 115: 173-178.
Cheng T C E, Wang G. Single machine with learning effect considerations [J]. Annals of Operations Research, 2000, 98: 273-290.
Mosheiov G. Scheduling problems with a learning effect [J]. European Journal of Operational Research, 2001, 132: 687-693.
Mosheiov G, Sidney J B. Scheduling with general job-dependent learning curves [J]. European Journal of Operational Research, 2003, 147: 665-670.
Biskup D. A state-of-the-art review on scheduling with learning effects [J]. European Journal of Operational Research. 2008, 188: 315-329.
Cheng T C E, Lai P J, Wu C C, et al. Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations [J]. Information Sciences, 2009, 179: 3127-3135.
Zhang X, Yan G. Single-machine scheduling problems with general learning effect [J]. OR Transactions, 2009, 13(4): 56-64.
Ham I, Hitomi K, Yoshida T. Group technology: applications to production management [M]. Boston: Kluwer-Nijhoff, 1985.
Allahverdi A, Gupta J N D, Aldowaisan T. A review of scheduling research involving setup considerations [J]. Omega, 1999, 27: 219-239.
Cheng T C E, Kovalyov M Y, Tuzikov A V. Single machine group scheduling with ordered criteria [J]. Journal of the Operational Research Society, 1996, 47: 315-320.
Lee W C, Wu C C. A note on single-machine group scheduling problems with position-based learning effect [J]. Applied Mathematical Modelling, 2009, 334(2): 159-2163.
Graham R L, Lawler E L, Lenstra J K, et al. Optimization and approximation in deterministic sequencing and scheduling: a survey [J]. Ann Discrete Math, 1979, 5: 287-326.
Wu C C, Lee W C. Single-machine and flowshop scheduling with a general learning effect model [J]. Computers and Industrial Engineering, 2009, 56: 1553-1558.

[1]	ZHAO Congcong, FANG Dandan, LI Rongheng. Optimal algorithms for hybrid flow shop schedule on two machines with learning effect [J]. Operations Research Transactions, 2020, 24(2): 42-60.
[2]	CHEN Rubing, YUAN Jinjiang. Single-machine scheduling to minimize total weighted late work with positional due-indices [J]. Operations Research Transactions, 2020, 24(2): 131-144.
[3]	ZHAO Xiaocheng, LI Dagang. Parallel machine scheduling with machine and human eligibility restrictions [J]. Operations Research Transactions, 2018, 22(3): 99-108.
[4]	JIU Mingzhu, GAO Yuan, YUAN Jinjiang. The bounded parallel-batching scheduling with drop-line jobs to minimize total completion time [J]. Operations Research Transactions, 2018, 22(1): 32-41.
[5]	ZHU Zhenglu, LU Xiwen. Minimizing makespan on two parallel machines with learning effects [J]. Operations Research Transactions, 2018, 22(1): 55-66.
[6]	LIU Ying, ZHANG Xingong. Three-echelon supply chain scheduling problem with learning effect [J]. Operations Research Transactions, 2016, 20(1): 31-42.
[7]	LI Wenhua, CHAI Xing, YUAN Hang, YANG Sufang. On-line algorithms for incompatible job families on parallel machines scheduling with lookahead [J]. Operations Research Transactions, 2015, 19(4): 121-126.
[8]	JING Caixia, ZHAO Congli, YUAN Erming. A review of re-entrant scheduling problems [J]. Operations Research Transactions, 2015, 19(2): 37-44.
[9]	YANG Su-Fang, LI Wen-Hua. On-line scheduling on a machine of two families with lookahead [J]. Operations Research Transactions, 2012, 16(2): 115-120.

Single-machine group scheduling problems with the sum-of-processing-time based on learning effect

PDF

Knowledge

Cited

Abstract

Cite this article

share this article

References

Related Articles 9

Recommended Articles

Metrics

Comments