Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource

DOI10.1016/0166-218X(92)90245-6zbMath0756.90054WikidataQ57387906 ScholiaQ57387906MaRDI QIDQ1186309

Dominique de Werra, Jacek Błażewicz

Publication date: 28 June 1992

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphedge coloringNP-completepolynomial-time algorithmspreemptive open shop schedulingrenewable and nonrenewable resource

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Related Items

Scheduling the two-machine open shop problem under resource constraints for setting the jobs ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ Bounded colouring motivated by the limited resource partially concurrent open shop problem ⋮ Extensions of coloring models for scheduling purposes ⋮ The combinatorics of timetabling ⋮ Complexity of some special types of timetabling problems ⋮ Open shop scheduling problems with conflict graphs

Cites Work

• Investigations on an edge coloring problem
• A preemptive open shop scheduling problem with one resource
• Preemptive Scheduling, Linear Programming and Network Flows
• Preemptive scheduling with staircase and piecewise linear resource availability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item