Openshop and flowshop scheduling to minimize sum of completion times
From MaRDI portal
Publication:1086145
DOI10.1016/0305-0548(84)90016-9zbMath0608.90050OpenAlexW2058834553MaRDI QIDQ1086145
Publication date: 1984
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(84)90016-9
Related Items
Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival, Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity, Open shop scheduling games, Four decades of research on the open-shop scheduling problem to minimize the makespan, Two machine flow shop scheduling problem with weighted WIP costs, Open shop scheduling with machine dependent processing times, Flow shops with WIP and value added costs, Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem, Scheduling ordered open shops, A polynomial algorithm for an open shop problem with unit processing times and tree constraints, The generalized shifting bottleneck procedure, Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems, A polynomial algorithm for the \([n/m/0,\;t_{ij}=1,\text{ tree}/C_{\max}\) open shop problem]
Cites Work
- Scheduling with Deadlines and Loss Functions
- Scheduling the Open Shop to Minimize Mean Flow Time
- The Complexity of Flowshop and Jobshop Scheduling
- Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
- A note on the influence of missing operations on scheduling problems
- Unnamed Item
