A metaheuristic for the fixed job scheduling problem under spread time constraints

Computers and Operations Research

Volumn 37, Issue 6, 2010, Pages 1045-1054

  Rossi, André ^a   Singh, Alok ^b   Sevaux, Marc ^a  

^a UNIVERSITÉ DE BRETAGNE SUD   (France)

^b UNIVERSITY OF HYDERABAD   (India)

Author keywords

Fixed job scheduling; Genetic algorithms; Spread time constraints

Indexed keywords

COMPLETION TIME; COMPUTATIONAL RESULTS; DUE DATES; EXACT APPROACH; FIXED JOB SCHEDULING; GREEDY HEURISTICS; GROUPING GENETIC ALGORITHMS; JOB SCHEDULING; JOB SCHEDULING PROBLEM; MEDIUM SIZE; METAHEURISTIC; PROCESSING TIME; RELEASE DATE; SCHEDULING PROBLEM; SPREAD-TIME; TIME SPENT;

GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; HEURISTIC METHODS;

SCHEDULING ALGORITHMS;

EID: 71749090660     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.09.007     Document Type: Article

References (15)

1. Bouzima K.I., and Emmons H. Interval scheduling on identical machines. Journal of Global Optimization 9 (1996) 379-393
2. Davis L. Handbook of genetic algorithms. New York: Van Nostrand Reinhold; 1991.
3. Eliiyi D.T., and Azizoǧlu M. Spread time considerations in operational fixed job scheduling. International Journal of Production Research 44 (2006) 4343-4365
4. Falkenauer E. New representations and operators for genetic algorithms applied to grouping problems. Evolutionary Computation 2 (1992) 123-144
5. Falkenauer E. Genetic algorithms and grouping problems (1998), Wiley, New York
6. Fischetti M., Martello S., and Toth P. The fixed job schedule problem with spread-time. Operations Research 35 (1987) 849-858
7. Fischetti M., Martello S., and Toth P. Approximation algorithms for fixed job schedule. Operations Research 40 (1992) S96-S108
8. Guéret C, Prins C, Sevaux M. Applications of optimisation with Xpress-MP. Dash optimization, 2002.
9. Huang QW, Lloyd E. Cost constrained fixed job scheduling. In: Theoretical computer sciences, proceedings. Lecture notes in computer science, vol. 2841. Berlin: Springer; 2003. p. 111-24.
10. Kroon L.G., Salomon M.M., and Wassenhove L.N. Exact and approximation algorithms for the operational fixed interval scheduling problem. European Journal of Operational Research 82 (1995) 190-205
11. Dash Optimization. XPress MP 〈http://www.dashoptimization.com/〉, 2008.
12. Rossi A, Sevaux M. Mixed-integer linear programming formulation for high level synthesis. In: Proceedings of 11th international workshop on project management and scheduling, PMS 2008, Istanbul Turkey, 2008. p. 222-6.
13. Singh A., and Baghel A.S. A new grouping genetic algorithm approach to the multiple traveling salesperson problem. Soft Computing 13 (2009) 95-101
14. Singh A., and Gupta A.K. Two heuristics for the one-dimensional bin-packing problem. OR Spectrum 29 (2007) 765-781
15. Xu J, Sun H, Yang W. Heuristic algorithm for fixed job scheduling problem. In: ICNC 2007: third international conference on natural computation, Proceedings, vol. 5, Haikou, China, August 24-27, 2007. p. 698-701.