Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness |
| |
Authors: | T.C.E. Cheng Chou-Jung Hsu Yi-Chi Huang Wen-Chiung Lee |
| |
Affiliation: | 1. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;2. Department of Industrial Engineering and Management, Nan Kai Institute of Technology, Taiwan;3. Department of Statistics, Feng Chia University, Taichung, Taiwan |
| |
Abstract: | In many realistic production situations, a job processed later consumes more time than the same job when it is processed earlier. Production scheduling in such an environment is known as scheduling with deteriorating jobs. However, research on scheduling problems with deteriorating jobs has rarely considered explicit (separable) setup time (cost). In this paper, we consider a single-machine scheduling problem with deteriorating jobs and setup times to minimize the maximum tardiness. We provide a branch-and-bound algorithm to solve this problem. Computational experiments show that the algorithm can solve instances up to 1000 jobs in reasonable time. |
| |
Keywords: | Single-machine scheduling Deteriorating jobs Setup time Maximum tardiness |
本文献已被 ScienceDirect 等数据库收录! |
|