Shop problems with two machines and Time Lags

Operations Research

Volumn 44, Issue 5, 1996, Pages 777-787

  Dell'Amico, Mauro ^a  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; JOB ANALYSIS; PROBLEM SOLVING; SCHEDULING;

FLOW SHOP SCHEDULING; JOB SHOP SCHEDULING; TABU SEARCH ALGORITHM;

OPERATIONS RESEARCH;

EID: 0030235028     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.44.5.777     Document Type: Article

References (18)

1. BERGE, C. 1973. Graphs and Hypergraphs. North Holland, Amsterdam.
2. BRUCKER, P. AND B. JURISCH. 1992. Job-shop (C codes). European J. Opnl. Res. 57, 132-133.
3. DELL'AMICO, M. 1989. A New Assignment Procedure for the Vehicle Scheduling Problem. Ricerca Operativa 51, 3-21 (in Italian).
4. DELL'AMICO, M. AND M. TRUBIAN. 1993. Applying Tabu Search to the Job-Shop Scheduling Problem. Ann. Opns. Res. 41, 231-252.
5. GAREY, M. R. AND D. S. JOHNSON. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA.
6. GLOVER, F. 1989. Tabu Search, Part I. ORSA J. Comput. 1, 190-206.
7. GLOVER, F. 1990. Tabu Search, Part II. ORSA J. Comput. 2, 4-32.
8. GLOVER, F. AND M. LAGUNA. 1993. Tabu Search. In Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford.
9. GRAHAM, R. L., E. L. LAWLER, J. K. LENSTRA, AND A. H. G. RINNOOY KAN. 1979. Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Anns. Discrete Math. 5, 287-326.
10. GOLUMBIC, M. C. 1977. The Complexity of Comparability Graph Recognition and Coloring. Computing 18, 199-208.
11. HEFETZ, N. AND I. ADIRI. 1982. An Efficient Optimal Algorithm for the Two-Machines Unit-Time Jobshop Schedule-Length Problem. Math. O. R. 7, 354-360.
12. JACKSON, J. R. 1956. An Extension of Johnson's Results on the Job Lot Scheduling. Naval Res. Logist. Quart. 3, 201-203.
13. JOHNSON, S. M. 1954. Optimal Two- and Three-Stage Production Schedules with Setup Times Included. Naval Res. Logist. Quart. 1, 61-68.
14. LAWLER, E. L., J. K. LENSTRA, A. H. G. RINNOOY KAN, AND D. B. SHMOYS. 1993. Sequencing and Scheduling: Algorithms and Complexity. In Handbooks in Operations Research and Management Science 4, S. C. Graves, P. H. Zipkin, A. H. G. Rinnooy Kan (eds.), North-Holland, Amsterdam.
15. LENSTRA, J. K. Unpublished.
16. LENSTRA, J. K., A. H. G. RINNOOY KAN, AND P. BRUKER. 1977. Complexity of Machine Scheduling Problems. Anns. Discrete Math. 1, 343-362.
17. LENSTRA, J. K. AND A. H. G. RINNOOY KAN. 1979. Computational Complexity of Discrete Optimization Problems. Anns. Discrete Math. 4, 121-140.
18. RINNOOY KAN, A. H. G. 1976. Machine Scheduling Problems: Classification, Complexity and Computations. Nijhoff, The Hague, Netherlands.