An efficient tabu search approach for the two-machine preemptive open shop scheduling problem
Author:
- 1 December 2003
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 30 (14) , 2081-2095
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A hybrid genetic algorithm for the open shop scheduling problemEuropean Journal of Operational Research, 2000
- 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
- Constructive heuristic algorithms for the open shop problemComputing, 1993
- Minimizing Total Tardiness on One Machine is NP-HardMathematics of Operations Research, 1990
- Scheduling the Open Shop to Minimize Mean Flow TimeSIAM Journal on Computing, 1982
- Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job ShopsOperations Research, 1981
- A Note on Open Shop Preemptive SchedulesIEEE Transactions on Computers, 1979
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- Open Shop Scheduling to Minimize Finish TimeJournal of the ACM, 1976