Mathematical modeling and heuristic approaches to flexible job shop scheduling problems

Aarts E.H.L., Korst J.H.M., van Laarhoven P.J.M. (1997). Simulated annealing. In: Aarts E., Lenstra J. (eds). Local search in combinatorial optimization. Chichester, Wiley, pp. 91–120

Brandimarte P. (1993). Routing and scheduling in a flexible job shop by taboo search. Annals of Operations Research, 41, 157–183

Bruker P., Schlie R. (1990). Job shop scheduling with multi-purpose machines. Computing, 45, 369–375

Cerny V. (1985). Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45, 41–51

Dauzere-Peres S., Paulli J. (1997). An integrated aooroach for modeling and solving the general multiprocessor job shop scheduling problem using tabu search. Annals of Operations Research, 70, 281–306

Garey M.R., Johnson D.S., Sethi R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117–129

Hurink E., Jurisch B., Thole M. (1994). Tabu search for the job shop scheduling problem with multi-purpose machines. Operations Research Spektrum, 15, 205–215

Johnson D.S., Aragon C.R., McGeoch L.A., Schevon C. (1989). Optimization by simulated annealing: An experimental evaluation; part 1, Graph partitioning. Operations Research, 37, 865–892

Kacem I., Hammadi S., 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

Kirkpatrick S., Gelatt Jr. C., Vecchi M. (1983). Optimization by simulated annealing. Science, 220, 671–680

Low C., Yip Y., Wu T. (2006). Modelling and heuristics of FMS scheduling with multiple objectives. Computers & Operations Research, 33, 674–694

Mastrololli M., Gambardella L.M. (2002). Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling, 3(1):3–20

Pham D.T., Karaboga D. (2000). Intelligent optimization techniques: Genetic algorithms, tabu search, simulated annealing and neural networks. London, Sringer

Saidi Mehrabad M., Fattahi P. (2007). Flexible job shop scheduling with tabu search algorithm. International Journal of Advanced Manufacturing Technology 32, 563–570

Van Laarhoven P.J.M., Aarts E.H.L. (1987). Simulated annealing: theory and applications. Dordrecht, Reidel

Xia W., Wu Z. (2005). An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering, 48, 409–425