Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
Publication:4033755
DOI10.1006/JAGM.1993.1002zbMATH Open0768.90039OpenAlexW1983676174MaRDI QIDQ4033755FDOQ4033755
Jian-Zhong Du, Joseph Y.-T. Leung
Publication date: 16 May 1993
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1993.1002
NP-hardnessflow shopopen shoppolynomial algorithmsjob preemptionmean job completion timefixed completion time
Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (16)
- The bipartite margin shop and maximum red matchings free of blue-red alternating cycles
- Bounding the running time of algorithms for scheduling and packing problems
- Title not available (Why is that?)
- On the open-shop problem with preemption and minimizing the average completion time
- A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP
- On the complexity of preemptive openshop scheduling problems
- Mean Flow Time Minimization in Reentrant Job Shops with a Hub
- Minimizing the Makespan and Flowtime in Two-Machine Stochastic Open Shops
- Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
- The two-machine total completion time flow shop problem
- Complexity of mixed shop scheduling problems: A survey
- Properties of optimal schedules in preemptive shop scheduling
- Integrality Property in Preemptive Parallel Machine Scheduling
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Title not available (Why is that?)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
This page was built for publication: Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033755)
