Complexity of flowshop scheduling problems with a new blocking constraint
- 16 March 2006
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 169 (3), 855-864
- https://doi.org/10.1016/j.ejor.2004.08.046
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Job-shop scheduling with blocking and no-wait constraintsEuropean Journal of Operational Research, 2002
- The permutation flow shop with buffers: A tabu search approachEuropean Journal of Operational Research, 1999
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in ProcessOperations Research, 1996
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum LatenessJournal of the Operational Research Society, 1983
- Flowshop scheduling with limited temporary storageJournal of the ACM, 1980
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a SurveyAnnals of Discrete Mathematics, 1979
- On the Flow-Shop Sequencing Problem with No Wait in Process†Journal of the Operational Research Society, 1972
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman ProblemOperations Research, 1964