Open shop scheduling problems with conflict graphs
From MaRDI portal
Publication:2357137
DOI10.1016/j.dam.2017.04.031zbMath1366.90105OpenAlexW2620006440MaRDI QIDQ2357137
Mourad Boudhar, Nour El Houda Tellache
Publication date: 19 June 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.04.031
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)
Related Items (8)
New results in two identical machines scheduling with agreement graphs ⋮ A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan ⋮ Scheduling on uniform machines with a conflict graph: complexity and resolution ⋮ Flow shop scheduling problem with conflict graphs ⋮ New complexity results for shop scheduling problems with agreement graphs ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A metric approach for scheduling problems with minimizing the maximum penalty ⋮ Two-machine open shop problem with agreement graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unit-time scheduling problems with time dependent resources
- Scheduling with conflicts: Online and offline algorithms
- Mutual exclusion scheduling with interval graphs or related classes. I
- Scheduling subject to resource constraints: Classification and complexity
- Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
- Classical and new heuristics for the open-shop problem: A computational evaluation
- Constructive heuristic algorithms for the open shop problem
- Scheduling with incompatible jobs
- A branch \(\&\) bound algorithm for the open-shop problem
- Mutual exclusion scheduling
- Scheduling jobs on identical machines with agreement graph
- Addendum: Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource
- A note on greedy algorithms for the maximum weighted independent set problem
- Scheduling the two-machine open shop problem under resource constraints for setting the jobs
- Scheduling: agreement graph vs resource constraints
- A preemptive open shop scheduling problem with one resource
- Open Shop Scheduling to Minimize Finish Time
- Two-Machine Open Shops with Renewable Resources
- Reducibility among Combinatorial Problems
- Scheduling
This page was built for publication: Open shop scheduling problems with conflict graphs
