Open shop scheduling with some additional constraints

DOI10.1007/BF01858447MaRDI QIDQ1911243zbMATH OpenOpenAlexFDO

Authors Dominique De Werra, Jacques Erschler

Publication date 7 October 1996

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

simultaneityNP-completeopen shop schedulingpreemptionschromatic schedulinggraph-theoretical model

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On the complexity of preemptive open-shop scheduling problems
• Shop scheduling problems under precedence constraints
• Restrictions and preassignments in preemptive open shop scheduling
• Nonpreemptive open shop with restricted processing times
• On the complexity of preemptive openshop scheduling problems

Cites work

• Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
• Almost nonpreemptive schedules
• Compact Cylindrical Chromatic Scheduling
• Edge-Chromatic Scheduling with Simultaneity Constraints
• Flow Management in Flexible Manufacturing Cells with Pipeline Operations
• Line perfect graphs
• On the Complexity of Timetable and Multicommodity Flow Problems
• Open Shop Scheduling to Minimize Finish Time
• The cyclic compact open-shop scheduling problem

Cited in

(22)

• New complexity results for shop scheduling problems with agreement graphs
• Extensions of coloring models for scheduling purposes
• A preemptive open shop scheduling problem with one resource
• Open shop scheduling with delays
• A note on the proof of the complexity of the little-preemptive open-shop problem
• Restrictions and preassignments in preemptive open shop scheduling
• On the complexity of preemptive open-shop scheduling problems
• Partially concurrent open shop scheduling with integral preemptions
• Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
• Nonpreemptive open shop with restricted processing times
• On the geometry, preemptions and complexity of multiprocessor and shop scheduling
• Preassignment requirements in chromatic scheduling
• scientific article; zbMATH DE number 3972609 (Why is no real title available?)
• Openshop scheduling under linear resources constraints
• Open shop scheduling with makespan and total completion time criteria
• Four decades of research on the open-shop scheduling problem to minimize the makespan
• Open-shop scheduling for unit jobs under precedence constraints
• Open-shop scheduling for unit jobs under precedence constraints
• Time slot scheduling of compatible jobs
• Open shop scheduling with synchronization
• The representation of partially-concurrent open shop problems
• Open shop scheduling problems with conflict graphs

This page was built for publication: Open shop scheduling with some additional constraints

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