Preemptive Scheduling of Hybrid Parallel Machines

DOI10.1287/OPRE.37.2.301MaRDI QIDQ3827789zbMATH OpenOpenAlexFDO

Authors Anantaram Balakrishnan

Publication date 1989

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.37.2.301

zbMATH Keywords

hybrid parallel machine environmentindependent workcellsminimum makespanMultioperation production facilitiesnetwork flow formulationpreemptive scheduling

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques
• scientific article; zbMATH DE number 3883931
• Preemptive hybrid flowshop scheduling problem of interval orders
• Preemptive scheduling on uniform machines to minimize mean flow time
• Preemptive scheduling with deadlines on parallel machines

Cited in

(2)

• Integer preemptive scheduling on parallel machines
• Preemptive scheduling on a small number of hierarchical machines

This page was built for publication: Preemptive Scheduling of Hybrid Parallel Machines

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