Scheduling identical jobs on uniform machines with a conflict graph

DOI10.1016/j.cor.2019.07.011zbMath1458.90330OpenAlexW2961418885WikidataQ127464981 ScholiaQ127464981MaRDI QIDQ2273690

Mourad Boudhar, Amin Mallek, Mohamed Bendraouche

Publication date: 25 September 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2019.07.011

zbMATH Keywords

schedulinguniform machinesmixed-integer linear programmingconflict graphidentical jobsincompatible jobs

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms ⋮ A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts ⋮ Scheduling on uniform machines with a conflict graph: complexity and resolution ⋮ Fair allocation of indivisible items with conflict graphs ⋮ Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers

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
• Scheduling jobs on identical machines with agreement graph
• An exact algorithm for parallel machine scheduling with conflicts
• Mutual exclusion scheduling with interval graphs or related classes. II
• Conflict Resolution in the Scheduling of Television Commercials
• Scheduling identical jobs on uniform parallel machines
• Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling

This page was built for publication: Scheduling identical jobs on uniform machines with a conflict graph