Scheduling open shops with parallel machines

DOI10.1016/0167-6377(82)90021-9zbMath0489.90053OpenAlexW1986298432MaRDI QIDQ1167065

Eugene L. Lawler, Vijay V. Vazirani, Michael Luby

Publication date: 1982

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(82)90021-9

zbMATH Keywords

open shopnetwork flowpolynomial-time algorithmsm parallel machinesn jobspreemptive schedule of minimum length

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (10)

On the complexity of preemptive openshop scheduling problems ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Flexible open shop scheduling problem to minimize makespan ⋮ A projective algorithm for preemptive open shop scheduling with two multiprocessor groups ⋮ A genetic algorithm for the proportionate multiprocessor open shop ⋮ Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop ⋮ Approximation algorithms for the multiprocessor open shop scheduling problem ⋮ Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time ⋮ Worst-case analysis of heuristics for open shops with parallel machines ⋮ Approximation algorithms for shop scheduling problems with minsum objective

Cites Work

• Scheduling with Deadlines and Loss Functions
• Open Shop Scheduling to Minimize Finish Time
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some simple scheduling algorithms
• Unnamed Item

This page was built for publication: Scheduling open shops with parallel machines