A bi-directional scheduling approach for job shops

International Journal of Production Research

Volumn 37, Issue 16, 1999, Pages 3823-3837

  Bushée, David C ^a   Svestka, Joseph A ^a  

^a Cleveland State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PROCESS CONTROL; SCHEDULING; STRATEGIC PLANNING;

BI-DIRECTIONAL SCHEDULING ALGORITHMS; JOB SHOPS;

PRODUCTION CONTROL;

EID: 0032596114     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/002075499190077     Document Type: Article

References (8)

1. Carlier, J. and Pinson, E., 1989, An algorithm for solving the job-shop problem. Management Science, 35, 164-176.
2. Deckro, R., Hebert, J. and Winkofsky, E., 1982, Multiple criteria job shop scheduling Computers and Operations Research, 18, 717-720.
3. French, S., 1984, Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop (Wiley).
4. Greenberg, H. H., 1968, A branch and bound solution to the general scheduling problem. Operations Research, 16, 353-361.
5. Kim, Y., 1994, A backward approach in list scheduling algorithms for multi-machine tardiness problems. Computers and Operations Research, 31, 307-319.
6. MacCarthy, B. L. and Liu, J., 1993, Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling. International Journal of Production Research, 31(1), 59-79.
7. Sun, D. and Lin, L, 1994, A dynamic job shop scheduling framework: a backward approach. International Journal of Production Research, 32, 967-985.
8. Wein, L M. and Chevalier, P B., 1992, A broader view of the job shop scheduling problem. Management Science, 38, 1018-1033