Scheduling on uniform machines with a conflict graph: complexity and resolution
From MaRDI portal
Publication:6187242
DOI10.1111/itor.13170OpenAlexW4283710936WikidataQ114080808 ScholiaQ114080808MaRDI QIDQ6187242
Publication date: 31 January 2024
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13170
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
- Restrictions of graph partition problems. I
- Scheduling with conflicts: Online and offline algorithms
- Mutual exclusion scheduling with interval graphs or related classes. I
- Scheduling with incompatible jobs
- Mutual exclusion scheduling
- Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
- Flow shop scheduling problem with conflict graphs
- Scheduling jobs on identical machines with agreement graph
- Makespan minimization on unrelated parallel machines with a few bags
- Scheduling identical jobs on uniform machines with a conflict graph
- Open shop scheduling problems with conflict graphs
- An exact algorithm for parallel machine scheduling with conflicts
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
- Conflict Resolution in the Scheduling of Television Commercials
- Scheduling identical jobs on uniform parallel machines
- New methods to color the vertices of a graph
- Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
- On minimizing the makespan when some jobs cannot be assigned on the same machine
This page was built for publication: Scheduling on uniform machines with a conflict graph: complexity and resolution
