An improved tabu search approach for solving the job shop scheduling problem with tooling constraints

Adams, 1988, The shifting bottleneck procedure for job shop scheduling, Management Sci., 34, 391, 10.1287/mnsc.34.3.391

Baker, 1974

Bard, 1988, A heuristic for minimizing the number of tool switches on a flexible machine, IIE Trans., 20, 382, 10.1080/07408178808966195

Barnes, 1993, A tabu search experience in production scheduling, Ann. Oper. Res., 41, 141, 10.1007/BF02023072

Berrada, 1986, A branch and bound approach for machine load balancing in flexible manufacturing systems, Management Sci., 32, 1316, 10.1287/mnsc.32.10.1316

Crama, 1994, Minimizing the number of tool switches on a flexible machine, Internat. J. Flexible Manufacturing Systems, 6, 33, 10.1007/BF01324874

Dell'Amico, 1993, Applying tabu search to the job-shop scheduling problem, Ann. Oper. Res., 41, 231, 10.1007/BF02023076

de Werra, 1989, Tabu search techniques: a tutorial and an application to neural networks, OR Spektum, 11, 131, 10.1007/BF01720782

de Werra, 1990, Loading problems with tool management in flexible manufacturing systems: a few integer programming models, Internat. J. Flexible Manufacturing Systems, 3, 71, 10.1007/BF00167526

Fisher, 1963, Probabilistic learning combinations of local job shop scheduling rules, 225

Follonier, 1992, On grouping parts and tools and balancing the workload on a flexible manufacturing system

Follonier, 1992, Minimization of the number of tool switches on a flexible manufacturing machine

Glover, 1986, Future paths for integer programming and links to artificial intelligence, Comput. Oper. Res., 13, 533, 10.1016/0305-0548(86)90048-1

Glover, 1989, Tabu search (part I), ORSA J. Comput., 1, 190, 10.1287/ijoc.1.3.190

Glover, 1990, Tabu search (part II), ORSA J. Comput., 2, 4, 10.1287/ijoc.2.1.4

Glover, 1993, A user's guide to tabu search, Ann. Oper. Res., 41, 3, 10.1007/BF02078647

Hansen, 1986, The steepest ascent mildest descent heuristic for combinatorial programming

Hertz, 1990, The tabu search metaheuristic: how we used it, Ann. Math. Artificial Intelligence, 1, 111, 10.1007/BF01531073

Hertz, 1992, Tabu search

Koulamas, 1991, Total tool requirements in multi-level machining systems, Internat. J. Prod. Res., 29, 417, 10.1080/00207549108930080

Lawrence, 1984

Mottet, 1991, Dynamic scheduling and tool loading, 325

Nowicki, 1993, A fast taboo search algorithm for the job shop problem, 10.1287/mnsc.42.6.797

Privault, 1994, Modèles mathématiques pour la gestion off-line et on-line des changements d'outils sur une machine flexible

Proust, 1991, Flowshop scheduling with set-up, processing and removal times separated, Internat. J. Prod. Res., 29, 479, 10.1080/00207549108930084

Roy, 1964, Les problèmes d'ordonnancement avec contraintes disjunctives

Taillard, 1994, Parallel taboo search technique for the jobshop scheduling problem, ORSA J. Comput., 6, 108, 10.1287/ijoc.6.2.108

Tang, 1988, Models arising from a flexible manufacturing machine: Part 1: Minimixation of the number of tool switches, Part II: Minimization of the number of switching instants, Oper. Res., 36, 767, 10.1287/opre.36.5.767

van Laarhoven, 1992, Job shop scheduling by simulated annealing, Oper. Res., 40, 113, 10.1287/opre.40.1.113

Veeramani, 1992, Cutting-tool management in computer-integrated manufacturing, Internat. J. Flexible Manufacturing Systems, 3–4, 237, 10.1007/BF01324882

Widmer, 1991, Job shop scheduling with tooling constraints: a tabu search approach, J. Oper. Res. Soc., 42, 75, 10.1057/jors.1991.9

Widmer, 1989, A new heuristic method for the flow shop sequencing problem, European J. Oper. Res., 41, 186, 10.1016/0377-2217(89)90383-4