Single-machine scheduling problems with both deteriorating jobs and learning effects |
| |
Authors: | Ji-Bo Wang Dan Wang Guo-Dong Zhang |
| |
Institution: | 1. Operations Research and Cybernetics Institute, School of Science, Shenyang Institute of Aeronautical Engineering, Shenyang 110136, People’s Republic of China;2. Knowledge Management and Innovation Research Centre, Xi’an Jiaotong University, Xi’an 710049, People’s Republic of China;3. School of Computer, Shenyang Institute of Aeronautical Engineering, Shenyang 110136, People’s Republic of China |
| |
Abstract: | In this paper we consider the single-machine scheduling problems with job-position-based and sum-of-processing-times based processing times. The real processing time of a job is a function of its position and the total processing time of the jobs that are in front of it in the sequence. The objective is to minimize the makespan, and to minimize the mean finish time. We prove that some special cases are polynomially solvable under some restrictions of the parameters. In addition, for some another special cases of minimization of the mean finish time and the makespan, we show that an optimal schedule is V-shaped with respect to job normal processing times. Then, we propose a heuristic based on the V-shaped property, and show through a computational experiment that it performs efficiently. |
| |
Keywords: | Scheduling Single machine Makespan Mean finish time |
本文献已被 ScienceDirect 等数据库收录! |
|