Flow shop scheduling problem with conflict graphs
From MaRDI portal
Recommendations
- Open shop scheduling problems with conflict graphs
- Scheduling identical jobs on uniform machines with a conflict graph
- New complexity results for shop scheduling problems with agreement graphs
- Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
- Flow shop scheduling problems under machine-dependent precedence constraints
Cites work
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- A note on greedy algorithms for the maximum weighted independent set problem
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 4137525 (Why is no real title available?)
- scientific article; zbMATH DE number 4095196 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Mutual exclusion scheduling
- Mutual exclusion scheduling with interval graphs or related classes. I
- Open shop scheduling problems with conflict graphs
- Optimal two- and three-stage production schedules with set-up time included
- Permutation vs. non-permutation flow shop schedules
- Reducibility among combinatorial problems
- Scheduling jobs on identical machines with agreement graph
- Scheduling subject to resource constraints: Classification and complexity
- Scheduling unit-time tasks in renewable resource constrained flowshops
- Scheduling with conflicts: Online and offline algorithms
- Scheduling with incompatible jobs
- Scheduling: agreement graph vs resource constraints
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm
- Some efficient heuristic methods for the flow shop sequencing problem
- Some new results in flow shop scheduling
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs
- The Complexity of Flowshop and Jobshop Scheduling
Cited in
(17)- Approximation algorithms for two-machine flow-shop scheduling with a conflict graph
- Order picking optimization with rack-moving mobile robots and multiple workstations
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- New complexity results for shop scheduling problems with agreement graphs
- Scheduling identical jobs on uniform machines with a conflict graph
- Two-machine open shop problem with agreement graph
- Open shop scheduling problems with conflict graphs
- An exact algorithm for parallel machine scheduling with conflicts
- New results in two identical machines scheduling with agreement graphs
- A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts
- scientific article; zbMATH DE number 4199943 (Why is no real title available?)
- scientific article; zbMATH DE number 4072696 (Why is no real title available?)
- Improved bounds for scheduling conflicting jobs with minsum criteria
- Minimum flow time graph ordering.
- Scheduling on uniform machines with a conflict graph: complexity and resolution
- A uniform sampling method for permutation space
- Due-window assignment scheduling in the proportionate flow shop setting
This page was built for publication: Flow shop scheduling problem with conflict graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708533)
