Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
In just-in-time (JIT) scheduling, the usual objective is to minimize a cost function which includes a penalty for both the early and tardy completion of jobs. In this paper, we survey results for a cost function that is related to the number of early and tardy jobs rather than the actual earliness and tardiness values. More specifically, we study the problem of maximizing the weighted number of jobs which are completed exactly on their due date (i.e., in JIT mode). Our survey covers the literature for various scheduling environments both with fixed and controllable processing times. We also describe several new algorithms for certain flow-shop problems.
- 9.Chudzik, K., Janiak, A., Lichtenstein, M.: Scheduling Problems with Resource Allocation. In A. Janiak, ed., Scheduling in Computer and Manufacturing Systems, WK L, Warszawa (2006)Google Scholar
- 11.Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals Discrete Mathematics 5, 287-326 (1979)Google Scholar
- 17.Józefowska, J.: Just-in-time Scheduling: Models and Algorithms for Computer and Manufacturing Systems, Springer-Verlag New York Inc (2007)Google Scholar
- 32.Shabtay, D., Bensoussan, Y.: Maximizing the Weighted Number of Just-in-Time Jobs in a Two Machine Flow and Open Shop Scheduling Systems. Journal of Scheduling, DOI: 10.1007/s10951-010-0204-yGoogle Scholar
- 33.Shabtay, D., Bensusan, Y., Kaspi, M.: A Bicriteria Approach to Maximize the Weighted Number of Just-In-Time Jobs and to Minimize the Total Resource Consumption Cost in a Two-Machine Flow-Shop Scheduling System, International Journal of Production Economics, to appearGoogle Scholar
- 36.Sung, S.C., Vlach, M.:Maximizing Weighted Number of Just-in-Time Jobs on Unrelated Parallel Machines, Journal of Scheduling 8, 453-460 (2005)Google Scholar