Scheduling the Open Shop to Minimize Mean Flow Time

DOI10.1137/0211058MaRDI QIDQ3954823zbMATH OpenOpenAlexFDO

Authors James O. Achugbue, Franics Y. Chin

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

zbMATH Keywords

approximate solutionmulti-processorsNP-complete

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited in

(26)

• On the complexity of preemptive open-shop scheduling problems
• Openshop and flowshop scheduling to minimize sum of completion times
• Open shop scheduling with machine dependent processing times
• Two-machine shop scheduling with zero and unit processing times
• An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
• 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
• Polynomial time approximation algorithms for machine scheduling: Ten open problems
• Reversible-shop scheduling
• Scheduling two-machine preemptive open shops to minimize total completion time
• NP-hardness of shop-scheduling problems with three jobs
• Bilevel programming applied to the flow shop scheduling problem
• Complexity of mixed shop scheduling problems: A survey
• Open shop scheduling games
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop
• Heuristic constructive algorithms for open shop scheduling to minimize mean flow time
• Optimal restricted due date assignment in scheduling
• Approximation scheduling algorithms: a survey
• On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem
• Scheduling ordered open shops
• Polynomial-time approximation schemes for scheduling problems with time lags
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
• Minimizing the sojourn time of open shop scheduling problems with unit-time operations
• Optimal due date assignment in multi-machine scheduling environments
• A new heuristic for open shop total completion time problem

This page was built for publication: Scheduling the Open Shop to Minimize Mean Flow Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3954823)