Almost nonpreemptive schedules

DOI10.1007/BF02248592zbMath0709.90059OpenAlexW1968789037MaRDI QIDQ922279

Dominique de Werra

Publication date: 1990

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02248592

zbMATH Keywords

flexible manufacturing systemstimetablinginterval coloringrenewable resourcestwo-phase methodchromatic schedulingline-perfect graphspreemptive and nonpreemptive scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Open shop scheduling with some additional constraints ⋮ On preemptive scheduling: A general setting for the two-phase method ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ On the deficiency of bipartite graphs

Cites Work

• On the two-phase method for preemptive scheduling
• Open Shop Scheduling to Minimize Finish Time
• Line perfect graphs
• On line perfect graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Almost nonpreemptive schedules