Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time
We consider a single-machine tool change scheduling problem where tool change durations are workload-dependent. The processing times of all the jobs are the same. The objective is to determine the number of tool change activities, the start time and the completion time of each tool change activity jointly and schedule all the jobs to the machine such that the total completion time of the jobs is minimized. For the case where the tool change duration function is concave, we present a linear time optimal algorithm. For the case where the tool change duration function is convex, we convert it into a convex integer quadratic programming problem with fixed dimension and then propose two polynomial time algorithms for it. We also study some special cases for which optimal schedules can be obtained directly. For the case where the tool change duration function is linear, we present all the optimal schedules.
KeywordsScheduling Tool change Workload-dependent Total completion time
We thank the referees for their valuable comments which improved the paper substantially. This research was supported by the National Natural Science Foundation of China (71201022).
- Hemmecke, R., Köppe, M., Lee, J., & Weismantel, R. (2010). Nonlinear integer programming. In 50 years of integer programming 1958–2008 (pp. 561–618). New York, NY: Springer.Google Scholar