Scheduling open shops with parallel machines

DOI10.1016/0167-6377(82)90021-9MaRDI QIDQ1167065zbMATH OpenOpenAlexFDO

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

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

network flowopen shoppolynomial-time algorithmsm parallel machinesn jobspreemptive schedule of minimum length

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites work

• scientific article; zbMATH DE number 3883931 (Why is no real title available?)
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling with deadlines and loss functions
• Some simple scheduling algorithms

Cited in

(10)

• A projective algorithm for preemptive open shop scheduling with two multiprocessor groups
• On the complexity of preemptive openshop scheduling problems
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
• 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
• Approximation algorithms for shop scheduling problems with minsum objective
• 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
• Worst-case analysis of heuristics for open shops with parallel machines

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

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