Two-stage heuristic procedure for scheduling job shops

Journal of Manufacturing Systems

Volumn 12, Issue 4, 1993, Pages 315-325

  Vancheeswaran, R ^a   Townsend, M A ^a  

^a UNIVERSITY OF VIRGINIA   (United States)

Author keywords

Directed Graph; Heuristics; Job Shop; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GRAPH THEORY; HEURISTIC METHODS; ITERATIVE METHODS; MATHEMATICAL MODELS; PRODUCTION CONTROL;

DIRECTED GRAPH; JOB SHOP SCHEDULING;

SCHEDULING;

EID: 0027872654     PISSN: 02786125     EISSN: None     Source Type: Journal    
DOI: 10.1016/0278-6125(93)90322-K     Document Type: Article

References (20)

1. The Shifting Bottleneck Procedure for Job Shop Scheduling
2. Machine Sequencing via Disjunctive Graphs An Implicit Enumeration Algorithm
3. An Algorithm for Finding Optimal or Near Optimal Solutions to the Production Scheduling Problem
4. The One Machine Sequencing Problem
5. Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules
6. An Implicit Enumeration Algorithm for the Machine Sequencing Problem
7. Performance Forecasts as Feedback for Schedule Generation
8. Simulation Studies of Multilevel Dynamic Job Shop Scheduling Using Heuristic Dispatching Rules
9. Job Shop Scheduling by Implicit Enumeration
10. Creation of a Factory Simulation for a Low-Technology Industry
11. Detailed Simulation of a Real World Job Shop with Subassembly Requirements
12. A Survey of Scheduling Rules
13. Base Load Scheduling: Theory and Practice
14. Les Problemmes d'Ordonnacement avec Constraintes Disjonctives
15. Solving Resource Constrained Network Problems by Implicit Enumeration-Nonpreemptive Case
16. Heuristics for Dynamic Selection and Routing of Parts in an FMS
17. Job Shop Scheduling Heuristics with Local Neighborhood Search