Affiliation:
1. Polish Naval Academy , Gdynia , Poland
Abstract
Abstract
Two possibilities of obtaining the minimal total weighted tardiness in tight-tardy single machine preemptive idling-free scheduling are studied. The Boolean linear programming model, which allows obtaining the exactly minimal tardiness, becomes too time-consuming as either the number of jobs or numbers of job parts increase. Therefore, a heuristic based on remaining available and processing periods is used instead. The heuristic schedules 2 jobs always with the minimal tardiness. In scheduling 3 to 7 jobs, the risk of missing the minimal tardiness is just 1.5 % to 3.2 %. It is expected that scheduling 12 and more jobs has at the most the same risk or even lower. In scheduling 10 jobs without a timeout, the heuristic is almost 1 million times faster than the exact model. The exact model is still applicable for scheduling 3 to 5 jobs, where the averaged computation time varies from 0.1 s to 1.02 s. However, the maximal computation time for 6 jobs is close to 1 minute. Further increment of jobs may delay obtaining the minimal tardiness at least for a few minutes, but 7 jobs still can be scheduled at worst for 7 minutes. When scheduling 8 jobs and more, the exact model should be substituted with the heuristic.
Reference12 articles.
1. [1] A. S. Uyar, E. Ozcan, and N. Urquhart, Eds. Automated Scheduling and Planning: From Theory to Practice. Springer-Verlag Berlin Heidelberg, 2013. https://doi.org/10.1007/978-3-642-39304-410.1007/978-3-642-39304-4
2. [2] J. M. Framinan, R. Leisten, and R. R. García, Manufacturing Scheduling Systems: An Integrated View on Models, Methods and Tools. Springer-Verlag London, 2014. https://doi.org/10.1007/978-1-4471-6272-810.1007/978-1-4471-6272-8
3. [3] F. Jaramillo and M. Erkoc, “Minimizing Total Weighted Tardiness and Overtime Costs for Single Machine Preemptive Scheduling,” Computers & Industrial Engineering, vol. 107, pp. 109–119, May 2017. https://doi.org/10.1016/j.cie.2017.03.01210.1016/j.cie.2017.03.012
4. [4] B. Yang, J. Geunes, and W. J. O’Brien, “A Heuristic Approach for Minimizing Weighted Tardiness and Overtime Costs in Single Resource Scheduling,” Computers and Operations Research, vol. 31, pp. 1273–1301, Jul. 2004. https://doi.org/10.1016/S0305-0548(03)00080-710.1016/S0305-0548(03)00080-7
5. [5] J. M. van den Akker, G. Diepen, and J. A. Hoogeveen, “Minimizing Total Weighted Tardiness on a Single Machine With Release Dates and Equal-Length Jobs,” Journal of Scheduling, vol. 13, iss. 6, pp. 561–576, Dec. 2010. https://doi.org/10.1007/s10951-010-0181-110.1007/s10951-010-0181-1
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献