|
|||||
|
|
Single Machine Scheduling with Learning Effect Considerations |
|
| Authors: | T.C. Edwin Cheng Guoqing Wang |
| Affiliation: | (1) Department of Management, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;(2) Department of Management, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong and;(3) Department of Business Administration, Jinan University, Guangzhou, China |
| Abstract: | In this paper we study a single machine scheduling problem in which the job processing times will decrease as a result of learning. A volume-dependent piecewise linear processing time function is used to model the learning effects. The objective is to minimize the maximum lateness. We first show that the problem is NP-hard in the strong sense and then identify two special cases which are polynomially solvable. We also propose two heuristics and analyse their worst-case performance. |
| Keywords: | scheduling sequencing learning |
| 本文献已被 SpringerLink 等数据库收录！ | |