Mean flow time minimization with given bounds of processing times
From MaRDI portal
Publication:1887954
DOI10.1016/S0377-2217(03)00424-7zbMATH Open1065.90038DBLPjournals/eor/LaiSSW04OpenAlexW1966592923WikidataQ57633931 ScholiaQ57633931MaRDI QIDQ1887954
Nadezhda Sotskova, Tsung-Chyan Lai, Frank Werner, Yuri N. Sotskov
Publication date: 22 November 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00424-7
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
Related Items (15)
The stability radius of an optimal line balance with maximum efficiency for a simple assembly line ⋮ Reliability analysis in presence of random variables and fuzzy variables ⋮ Schedule execution for two-machine flow-shop with interval processing times ⋮ Unnamed Item ⋮ Minimizing total weighted completion time with uncertain data: a stability approach ⋮ An artificial bee colony algorithm for the job shop scheduling problem with random processing times ⋮ Stability polyhedra of optimal permutation of jobs servicing ⋮ Unnamed Item ⋮ A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines ⋮ Uncertainty measure for the Bellman-Johnson problem with interval processing times ⋮ Minimizing total weighted flow time under uncertainty using dominance and a stability box ⋮ Algorithms for minimizing weighted flow time ⋮ Group shops scheduling with makespan criterion subject to random release dates and processing times ⋮ TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES ⋮ The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times
This page was built for publication: Mean flow time minimization with given bounds of processing times
