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 graph; edge coloring; NP-complete; polynomial-time algorithms; preemptive open shop scheduling; renewable and nonrenewable resource

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

05C99: Graph theory

Related Items

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, Scheduling the two-machine open shop problem under resource constraints for setting the jobs

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