Journal
ANNALS OF OPERATIONS RESEARCH
Volume 249, Issue 1-2, Pages 175-195Publisher
SPRINGER
DOI: 10.1007/s10479-015-1824-6
Keywords
Scheduling; Deteriorating jobs; Serial-batching; Sequence-dependent setup time
Categories
Funding
- National Natural Science Foundation of China [71231004, 71171071, 71131002]
- LATNA laboratory, NRU HSE, RF government grant [ag. 11.G34.31.0057]
Ask authors/readers for more resources
In this paper, we study a scheduling model in which the features of deteriorating jobs, serial batches, multiple job types, and setup times are considered simultaneously. In this proposed model, the jobs of each type are first partitioned into serial batches, and then all batches of different job types are processed on a single serial-batching machine. The actual job processing time is an increasing function of its starting time, and the setup time of the batches is sequence-dependent, i.e., setup time is required only when a new batch is processed first on the machine or immediately after a batch belonging to another job type. We develop optimization algorithms to solve the makespan minimization problem, the maximum tardiness minimization problem, the maximum lateness minimization problem, and the maximum earliness minimization problem, respectively. We also propose optimization algorithms to solve the problem of minimizing the number of tardy jobs under a certain agreeable condition. Finally, we discuss two special cases of the total completion time minimization problem and develop optimization algorithms to solve them.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available