Scheduling with periodic availability constraints and irregular cost functions

RAIRO - Operations Research

Volumn 41, Issue 2, 2007, Pages 141-154

  Sourd, Francis ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Availability; Break; Earliness tardiness; Scheduling

Indexed keywords

COST FUNCTIONS; HEURISTIC ALGORITHMS; PROBLEM SOLVING; RESOURCE ALLOCATION; SCHEDULING;

EARLINESS-TARDINESS; EFFICIENCY CONSTRAINTS; POLYNOMIAL TIME; TARDINESS COSTS; TIME-PERIODIC;

OPERATIONS RESEARCH;

EID: 34547452176     PISSN: 03990559     EISSN: 28047303     Source Type: Journal    
DOI: 10.1051/ro:2007016     Document Type: Article

References (12)

1. N. Brauner, Y. Crama, A. Grigoriev and van de Klundert, A framework for the complexity of high-multiplicity scheduling problems. J. Combin. Optim. 9 (2005) 313-323.
2. J.J. Clifford and M.E. Posner, High multiplicity in earliness-tardiness scheduling. Oper. Res. 48 (2000) 788-800.
3. M.R. Garey, R.E. Tarjan and G.T. Wilfong, One-processor scheduling with symmetric earliness and tardiness penalties. Math. Oper. Res. 13 (1988) 330-348.
4. A. Grosso, F. Della Croce and R. Tadei, An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Oper. Res. Lett. 32 (2004) 68-72.
5. C. Hanen and A. Munier, Cyclic scheduling on parallel processors: an overview, Scheduling Theory and its applications, edited by P. Chrétienne, E.G. Coffman, J.K. Lenstra and Z. Liu, John Wiley &¿ Sons (1995) 193-226.
6. Y. Hendel and F. Sourd, Efficient neighborhood search for the one-machine ealiness-tardiness scheduling problems. Eur. J. Oper. Res. 173 (2006) 108-119.
7. D. S. Hochbaum and R. Shamir, Strongly polynomial algorithms for the high multiplicity scheduling problem. Oper. Res. 39 (1991) 648-653.
8. ILOG Inc., ILOG Scheduler 6.0 User's Manual and Reference Manual (October 2003).
9. C-Y. Lee, Machine scheduling with availability constraints, Handbook of scheduling: Algorithms, models and performance analysis, edited by J.Y.-T. Leung, Chapman & Hall/CRC (2004).
10. W. Nuijten, T. Bousonville, F. Focacci, D. Godard and C. Le Pape, Towards a real-life manufacturing scheduling problem and test bed, in Proceedings of PMS'04, http://www2.ilog.com/masclib (2004) 162-165.
11. F. Sourd, Optimal timing of a sequence of tasks with general completion costs. Eur. J. Oper. Res. 165 (2005) 82-96.
12. F. Sourd and S. Kedad-Sidhoum, A new branch-and-bound algorithm for the minimization of earliness and tardiness on a single machine, in 7th workshop on Models and Algorithms for Planning and Scheduling Problems (2005) 258-261.