Journal
JOURNAL OF GLOBAL OPTIMIZATION
Volume 67, Issue 1-2, Pages 251-262Publisher
SPRINGER
DOI: 10.1007/s10898-015-0320-5
Keywords
Scheduling; Serial-batching; Deteriorating jobs; Learning effect; Single-machine
Funding
- National Natural Science Foundation of China [71231004, 71171071, 71131002, 71201042]
- Fundamental Research Funds for the Central Universities [JZ2015HGBZ0116, JZ2015HGBZ0117, JZ2015HGQC0187]
- project of Distinguished International Professor by the Chinese Ministry of Education [MS2014HFGY026]
Ask authors/readers for more resources
This paper deals with serial-batching scheduling problems with the effects of deterioration and learning, where time-dependent setup time is also considered. In the proposed scheduling models, all jobs are first partitioned into serial batches, and then all batches are processed on a single serial-batching machine. The actual job processing time is a function of its starting time and position. In addition, a setup time is required when a new batch is processed, and the setup time of the batches is time-dependent, i.e., it is a linear function of its starting time. Structural properties are derived for the problems of minimizing the makespan, the number of tardy jobs, and the maximum earliness. Then, three optimization algorithms are developed to solve them, respectively.
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