Routing and scheduling in a flexible job shop by tabu search

J. Adams, E. Balas and D. Zawack, The shifting bottleneck procedure for job shop scheduling, Manag. Sci. 34(1988)391–401.

R. Akella, Y. Choong and S.B. Gershwin, Performance of a hierarchical production scheduling policy, IEEE Trans. Components, Hybrids and Manufacturing Technol. CHMT-7(1984)225–248.

E. Balas, Machine sequencing via disjunctive graphs: an implicit enumeration algorithm, Oper. Res. 17(1969)941–957.

J.W. Barnes and J.B. Chambers, Solving the job shop scheduling problem using tabu search, Technical Report ORP91-06, University of Texas at Austin (1991).

B. Bona, P. Brandimarte, C. Greco and G. Menga, Hybrid hierarchical scheduling and control systems in manufacturing, IEEE Trans. Robotics and Automation RA-6(1990)673–686.

P. Brandimarte, R. Conterno and P. Laface, FMS production scheduling by simulated annealing,Proc. 3rd Conf. on Simulation in Manufacturing, Torino (Nov. 1987) pp. 235–245.

P. Brandimarte, Using abstract data types in developing search-based schedulers,Proc. ICARV'90 (Int. Conf. on Automation, Robotics and Computer Vision), Singapore (1990) pp. 6–10.

P. Brandimarte, Bicriteria parallel machine scheduling by local search, in preparation.

P. Brandimarte, W. Ukovich and A. Villa, Factory level aggregate scheduling: a basis for a hierarchical approach,Proc. 1992 IEEE Conf. on CIM, RPI, Troy, NY.

Y.-L. Chang, H. Matsuo and R.S. Sullivan, A bottleneck-based beam search for job scheduling in a flexible manufacturing system, Int. J. Prod. Res. 27(1989)1949–1961.

L.F. Esudero, A mathematical formulation of a hierarchical approach for production planning in FMS, in:Modern Production Management Systems, ed. A. Kusiak (North-Holland, 1987) pp. 231–245.

L.F. Escudero, An inexact algorithm for part input sequencing and scheduling with side constraints in FMS, Int. J. Flexible Manufacturing Syst. 1(1989)143–174.

E. Falkenauer and S. Bouffouix, A genetic algorithm for job shop,Proc. 1991 IEEE Conf. on Robotics and Automation, Sacramento, CA, pp. 824–829.

R. Fletcher,Practical Methods of Optimization, 2nd ed. (Wiley, 1987).

S. French,Sequencing and Scheduling: an Introduction to the Mathematics of Job Shop (Wiley, 1982).

F. Glover, Tabu search, Part I, ORSA J. Comput. 1(1989)190–206.

F. Glover, Tabu search, Part II, ORSA J. Comput. 2(1990)4–32.

F. Glover and R. Hübscher, Bin packing with tabu search, preprint (1991).

D.E. Goldberg,Genetic Algorithms in Search, Optimization and Machine Learning (Wiley, 1989).

J. Hutchison, K. Leong, D. Snyder and P. Ward, Scheduling approaches for random job shop flexible manufacturing systems, Int. J. Prod. Res. 29(1991)1053–1067.

Y.-D. Kim, A comparison of dispatching rules for job shops with multiple identical jobs and alternative routings, Int. J. Prod. Res. 28(1990)953–962.

E.J. Lee and P. Mirchandani, Concurrent routing, sequencing and setups for a two-machine flexible manufacturing cell, IEEE J. Robotics and Automation RA-4(1988)256–264.

S. Kirkpatrick, C.D. Gelatt and M.P. Vecchi, Optimization by simulated annealing, Science 220(1983)621–680.

M. Laguna, J.W. Barnes and F. Glover, Tabu search methods for a single machine scheduling problem, J. Int. Manufacturing 2(1991)63–74.

M. Laguna and F. Glover, Integrating target analysis and tabu search for improved scheduling systems, Expert Syst. Appl., to appear.

M. Laguna and J.L.G. Velarde, A search heuristic for just-in-time scheduling in parallel machines, J. Int. Manufacturing 2(1991)253–260.

B. Meyer,Object-Oriented Software Construction (Prentice-Hall, 1988).

P. Mirchandani, E.J. Lee and A. Vasque, Concurrent scheduling in flexible automation, Technical Report No. 37-88-149, Department of Decision Sciences and Engineering Systems, Rensselaer Polytechnic Institute, Troy, NY (1988).

M. Montazeri and L.N. Van Wassenhove, Analysis of scheduling rules for an FMS, Int. J. Prod. Res. 28(1990)785–802.

N. Nasr and E.A. Elsayed, Job shop scheduling with alternative machines, Int. J. Prod. Res. 28(1990)1595–1609.

F.A. Ogbu and D.K. Smith, The application of the simulated annealing algorithm to the solution of then/m/C max flowshop problem, Comput. Oper.Res. 17(1990)243–253.

I.H. Osman and C.N. Potts, Simulated annealing for permutation flow-shop scheduling, OMEGA Int. J. Manag. Sci. 17(1989)551–557.

P.S. Ow and T.E. Morton, Filtered beam search in scheduling, Int. J. Prod. Res. 26(1988)35–62.

S.S. Panwalkar and W. Iskander, A survey of scheduling rules, Oper. Res. 25(1977)45–61.

R.G. Parker and R.L. Rardin,Discrete Optimization (Wiley, 1988).

G.N. Saridis, Analytical formulation of the principle of increasing precision with decreasing intelligence for intelligent machines, Automatica 25(1989)461–467.

T. Sawik, Modelling and scheduling of a flexible manufacturing system, Eur. J. Oper. Res. 45(1990)177–190.

K.E. Stecke, Formulation and solution of nonlinear integer production planning problems for flexible manufacturing systems, Manag. Sci. 29(1983)273–288.

E. Taillard, Parallel taboo search technique for the job shop scheduling problem, Research Report ORWP 89/11, Ecole Polytechnique Fédérale de Lausanne (1989).

E. Tocylowski, K.S. Hindi and M.G. Singh, Multi-level production scheduling for a class of flexible machine and assembly systems, Ann. Oper. Res. 17(1989)163–180.

P.J.M. van Laarhoven and E.H.L. Aarts,Simulated Annealing: Theory and Applications (Reidel, 1987).

P.J.M. van Laarhoven, E.H.L. Aarts and J.K. Lenstra, Job shop scheduling by simulated annealing, Report OS-R8809, CWI, Amsterdam (1988).

A.P.J. Vepsalainen and T.E. Morton, Priority rules for job shops with weighted tardiness costs, Manag. Sci. 33(1987)1035–1047.

M. Widmer, Job shop scheduling with tooling constraints: a tabu search approach, J. Oper. Res. Soc. 42(1991)75–82.

M. Widmer and A. Hertz, A new heuristic method for the flow shop sequencing problem, Eur. J. Oper. Res. 41(1989)186–193.