Scheduling the Open Shop to Minimize Mean Flow Time
From MaRDI portal
Publication:3954823
DOI10.1137/0211058zbMath0492.68038OpenAlexW2093824221MaRDI QIDQ3954823
Franics Y. Chin, James O. Achugbue
Publication date: 1982
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0211058
Related Items
Openshop and flowshop scheduling to minimize sum of completion times, Scheduling two-machine preemptive open shops to minimize total completion time, Optimal due date assignment in multi-machine scheduling environments, NP-hardness of shop-scheduling problems with three jobs, Optimal restricted due date assignment in scheduling, Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop, Bilevel programming applied to the flow shop scheduling problem, Polynomial-time approximation schemes for scheduling problems with time lags, An efficient tabu search approach for the two-machine preemptive open shop scheduling problem., Complexity of mixed shop scheduling problems: A survey, Open shop scheduling games, Open shop scheduling with machine dependent processing times, On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem, Heuristic constructive algorithms for open shop scheduling to minimize mean flow time, A new heuristic for open shop total completion time problem, Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments, Scheduling ordered open shops, Polynomial time approximation algorithms for machine scheduling: Ten open problems, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, Reversible-shop scheduling, Approximation scheduling algorithms: a survey, Two-machine shop scheduling with zero and unit processing times, On the complexity of preemptive open-shop scheduling problems, The total completion time open shop scheduling problem with a given sequence of jobs on one machine, Approximation algorithms for shop scheduling problems with minsum objective
