Decomposition methods for large job shops

Computers and Operations Research

Volumn 28, Issue 3, 2001, Pages 193-207

  Singer, Marcos ^a  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

Author keywords

Job shop; Rolling horizon; Scheduling

Indexed keywords

HEURISTIC METHODS; PROBLEM SOLVING; PROCESS ENGINEERING; SCHEDULING; STRATEGIC PLANNING;

DECOMPOSITION METHODS; JOB SHOPS; ROLLING HORIZON HEURISTICS;

PRODUCTION CONTROL;

DECOMPOSITION ANALYSIS;

EID: 0034155381     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(99)00098-2     Document Type: Article

References (27)

1. A broader view of the job-shop scheduling problem
2. An algorithm for solving the job-shop problem
3. Probabilistic learning combinations of local job-shop scheduling rules
4. A branch and bound algorithm for the job-shop scheduling problem
5. A new approach for computing optimal schedules for the job-shop scheduling problem
6. The shifting bottleneck procedure for job shop scheduling
7. A modified shifting bottleneck procedure for job-shop scheduling
8. A computational study of the job shop scheduling problem
9. The one-machine problem with delayed precedence constraints and its use in the job shop scheduling
10. Job shop scheduling by simulated annealing
11. Parallel taboo search techniques for the job shop scheduling problem
12. Solving the job shop scheduling problem with tabu search
13. A fast taboo search algorithm for the job shop problem
14. A shifting bottleneck algorithm for scheduling semiconductor testing operations
15. Complexity of machine scheduling problems
16. Computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops
17. Priority rules for job shops with weighted tardiness cost
18. A shifting bottleneck heuristic for minimizing the total weighted tardiness in a job shop
19. Rolling horizon procedures for single-machine dynamic scheduling problem with sequence-dependent setup times
20. Machine sequencing via disjunctive graphs: An implicit enumeration algorithm
21. On a routing problem
22. Designing and reporting on computational experiments with heuristic methods
23. Needed: An empirical science of algorithms
24. Toward an experimental method for algorithm simulation
25. Due dates in job shop scheduling