Flow shop scheduling problem with conflict graphs

DOI10.1007/s10479-017-2560-xzbMath1384.90049OpenAlexW2631032937MaRDI QIDQ1708533

Mourad Boudhar, Nour El Houda Tellache

Publication date: 23 March 2018

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-017-2560-x

zbMATH Keywords

complexityheuristicsschedulingconflict graphflow-shop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph ⋮ Due-window assignment scheduling in the proportionate flow shop setting ⋮ New results in two identical machines scheduling with agreement graphs ⋮ Scheduling on uniform machines with a conflict graph: complexity and resolution ⋮ New complexity results for shop scheduling problems with agreement graphs ⋮ Two-machine open shop problem with agreement graph ⋮ Order picking optimization with rack-moving mobile robots and multiple workstations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling with conflicts: Online and offline algorithms
• Some efficient heuristic methods for the flow shop sequencing problem
• Mutual exclusion scheduling with interval graphs or related classes. I
• Scheduling subject to resource constraints: Classification and complexity
• Permutation vs. non-permutation flow shop schedules
• Scheduling with incompatible jobs
• Mutual exclusion scheduling
• Scheduling jobs on identical machines with agreement graph
• A note on greedy algorithms for the maximum weighted independent set problem
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
• Open shop scheduling problems with conflict graphs
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm
• Scheduling: agreement graph vs resource constraints
• Optimal two- and three-stage production schedules with setup times included
• Some new results in flow shop scheduling
• Scheduling unit-time tasks in renewable resource constrained flowshops
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• The Complexity of Flowshop and Jobshop Scheduling
• Reducibility among Combinatorial Problems
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: Flow shop scheduling problem with conflict graphs