A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem

International Journal of Production Research

Volumn 49, Issue 23, 2011, Pages 6963-6980

  Vilcot, Geoffrey ^a,b   Billaut, Jean Charles ^a  

^a Volume Software   (France)

^b UNIVERSITÉ DE TOURS   (France)

Author keywords

Jobshop; Multi objective; Scheduling; Tabu search

Indexed keywords

FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; JOB-SHOP; LINEAR COMBINATIONS; MAKESPAN; MAXIMUM LATENESS; MULTI OBJECTIVE; MULTI-CRITERIA; NONDOMINATED SOLUTIONS; TABU SEARCH ALGORITHMS; TOTAL TARDINESS;

LEARNING ALGORITHMS; SCHEDULING; SCHEDULING ALGORITHMS;

TABU SEARCH;

EID: 84855798863     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207543.2010.526016     Document Type: Article

References (15)

1. Alvarez-Valdes, R., et al., 2005. A heuristic to schedule flexible job-shop in glass factory. European Journal of Operational Research, 165, 525-534. (Pubitemid 40206380)
2. Brandimarte, P., 1993. Routing and scheduling in a flexible job shop by tabu search. Annals of Operations Research, 22, 158-183.
3. Choobineh, F., Mohebbi, E., and Khoo, H., 2006. A multi-objective tabu search for a singlemachine scheduling problem with sequence-dependent setup time. European Journal of Operational Research, 175, 318-337. (Pubitemid 44470727)
4. Dauzère-Pérès, S. and Paulli, J., 1997. An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Annals of Operations Research, 70, 3-20.
5. Deb, K., et al., 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6 (2), 182-197. (Pubitemid 34555372)
6. Demirkol, E., Mehta, S., and Uzsoy, R., 1998. Benchmarks for shop scheduling problems. European Journal of Operational Research, 109, 137-141. (Pubitemid 128393234)
7. Downsland, K., 1998. Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research, 106, 393-407.
8. Glover, F., 1989. Tabu search-Part I. ORSA Journal on Computing, 1, 190-206.
9. Ho, N.B., Tay, J.C., and Lai, E.M.-K., 2007. An effective architecture for learning and evolving flexible job-shop schedules. European Journal of Operational Research, 179, 316-333. (Pubitemid 44821629)
10. Hurink, J., Jurisch, B., and Thole, M., 1994. Tabu search for the job-shop scheduling problem with multipurpose machines. OR Spektrum, 15, 205-215.
11. Jurisch, B., 1992. Scheduling Jobs in shops with multi-purpose machines. Thesis PhD. Germany: University of Osnabrük.
12. Kacem, I., Hammadi, S., and Borne, P., 2002. Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation, 60, 245-276.
13. Mastrolilli, M. and Gambardella, L.-M., 2000. Effective neighborhood function for the flexible job shop problem. Journal of Scheduling, 3 (1), 3-20.
14. Paulli, J., 1995. A hierarchical approach for the FMS scheduling problem. European Journal of Operational Research, 86, 32-42.
15. T'kindt, V. and Billaut, J.-C., 2006. Multicriteria scheduling. Theory, models and algorithms. 2nd ed. Berlin: Springer.