A note on scheduling flowshops with flexible stage ordering
From MaRDI portal
Publication:5925946
DOI10.1016/S0377-2217(99)00430-0zbMath0990.90042MaRDI QIDQ5925946
Christos P. Koulamas, Kyparisis, George J.
Publication date: 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Unnamed Item
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- A new constructive heuristic for the flowshop scheduling problem
- Variability Reduction Through Operations Reversal
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
This page was built for publication: A note on scheduling flowshops with flexible stage ordering