Mean flow time minimization with given bounds of processing times
From MaRDI portal
Publication:1887954
DOI10.1016/S0377-2217(03)00424-7zbMath1065.90038WikidataQ57633931 ScholiaQ57633931MaRDI QIDQ1887954
Frank Werner, Yuri N. Sotskov, Tsung-Chyan Lai, Nadezhda Sotskova
Publication date: 22 November 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
Related Items
Group shops scheduling with makespan criterion subject to random release dates and processing times, Schedule execution for two-machine flow-shop with interval processing times, TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stability of a schedule minimizing mean flow time
- Current trends in deterministic scheduling
- Optimal makespan scheduling with given bounds of processing times
- Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
- On the set of solutions of the open shop problem
- Sequencing with uncertain numerical data for makespan minimisation
- The Minimum Common-Cycle Algorithm for Cyclic Scheduling of Two Material Handling Hoists with Time Window Constraints