A preemptive open shop scheduling problem with one resource

DOI10.1016/0167-6377(91)90080-9zbMath0721.90046DBLPjournals/orl/WerraBK91OpenAlexW2031705523WikidataQ57387909 ScholiaQ57387909MaRDI QIDQ2641218

Dominique de Werra, Jacek Błażewicz, Wiesław X. Kubiak

Publication date: 1991

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

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

zbMATH Keywords

nonrenewable resourcebipartite multigraphpreemptive open shop scheduling

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Minimizing the total completion time in a unit-time open shop with release times ⋮ Scheduling the two-machine open shop problem under resource constraints for setting the jobs ⋮ Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Unit-time scheduling problems with time dependent resources ⋮ Survey on fuzzy shop scheduling ⋮ Open shop scheduling problems with conflict graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexity of a 3-dimensional assignment problem
• Investigations on an edge coloring problem
• Preemptive Scheduling, Linear Programming and Network Flows
• Preemptive scheduling with staircase and piecewise linear resource availability
• Open Shop Scheduling to Minimize Finish Time

This page was built for publication: A preemptive open shop scheduling problem with one resource