Solving the open shop scheduling problem
- 25 May 2001
- journal article
- research article
- Published by Wiley in Journal of Scheduling
- Vol. 4 (3) , 157-174
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- An iterative improvement approach for the nonpreemptive open shop scheduling problemEuropean Journal of Operational Research, 1998
- Classical and new heuristics for the open-shop problem: A computational evaluationEuropean Journal of Operational Research, 1998
- A branch & bound algorithm for the open-shop problemDiscrete Applied Mathematics, 1997
- The generalized Shifting Bottleneck ProcedureEuropean Journal of Operational Research, 1996
- Scheduling Computer and Manufacturing Processes1996
- Insertion techniques for the heuristic solution of the job shop problemDiscrete Applied Mathematics, 1995
- Adjustment of heads and tails for the job-shop problemEuropean Journal of Operational Research, 1994
- Constructive heuristic algorithms for the open shop problemComputing, 1993
- Benchmarks for basic scheduling problemsEuropean Journal of Operational Research, 1993
- A Computational Study of the Job-Shop Scheduling ProblemINFORMS Journal on Computing, 1991