Algorithms for parallel processor scheduling with distinct due windows and unit-time jobs
Divisions of PAS
ISSN 0239-7528, eISSN 2300-1917
Sidney J. (1977), Optimal single-machine scheduling with earliness and tardiness penalties, Operations Research, 25, 1, 62. ; Lawler E. (1977), A pseudopolynomial algorithm for sequence jobs to minimizing total tardiness, Annals of Discrete Mathematics, 1, 331. ; Koulamas C. (1996), Single-machine scheduling with time windows and earliness/tardiness penalties, Eur. J. Operational Research, 96, 190. ; Wan G. (2002), Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties, Eur. J. Operational Research, 142, 271. ; Koulamas C. (1997), Maximizing the weighted number of on-time jobs in single machine scheduling with time windows, Mathematical and Computer Modelling, 25, 10, 57. ; Yoo W.-S. (2001), Scheduling single-machine problems for on-time delivery, Computers & Indusrial Engineering, 39, 371. ; Janiak A. (2009), Single processor scheduling problems with various models of a due window, Bull. Pol. Ac.: Tech, 57, 1, 95. ; Blazewicz J. (2007), Handbook on Scheduling. From Theory to Applications. ; Peter Brucker (2007), Scheduling Algorithms. ; Baptiste P. (2004), Ten notes on equal-execution-time scheduling, 4OR, 2, 111, doi.org/10.1007/s10288-003-0024-4 ; Fredman M. (1987), Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM, 34, 3, 596. ; Punnen A. (2009), Bottleneck flows in unit capacity networks, Information Processing Letters, 109, 334.