Tabu search for the job-shop scheduling problem with multi-purpose machines
暂无分享,去创建一个
[1] Michael S. Salvador,et al. A Solution to a Special Class of Flow Shop Scheduling Problems , 1973 .
[2] Ronald L. Graham,et al. Bounds for certain multiprocessing anomalies , 1966 .
[3] Egon Balas,et al. The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .
[4] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[5] Bernd Jurisch,et al. Scheduling jobs in shops with multi-purpose machines , 1992 .
[6] Mauro Dell'Amico,et al. Applying tabu search to the job-shop scheduling problem , 1993, Ann. Oper. Res..
[7] J. Carlier,et al. An algorithm for solving the job-shop problem , 1989 .
[8] Wolfgang Meyer. Geometrische Methoden zur Lösung von Job-Shop Problemen und deren Verallgemeinerungen , 1992 .
[9] Paolo Brandimarte,et al. Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..
[10] Peter Brucker,et al. A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..
[11] Johann Hurink,et al. Polygon Scheduling , 1996, Discret. Appl. Math..
[12] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[13] William J. Cook,et al. A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.
[14] Eric Pinson,et al. A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera , 1991 .
[15] Jan Karel Lenstra,et al. Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..
[16] Frank Werner,et al. Insertion Techniques for the Heuristic Solution of the Job Shop Problem , 1995, Discret. Appl. Math..
[17] Thomas E. Morton,et al. The single machine early/tardy problem , 1989 .
[18] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..
[19] E. Nowicki,et al. A block approach for single-machine scheduling with release dates and due dates , 1986 .