An exact algorithm for parallel machine scheduling with conflicts
From MaRDI portal
Publication:2400043
DOI10.1007/s10951-016-0482-0zbMath1375.90128OpenAlexW2272903275MaRDI QIDQ2400043
Publication date: 25 August 2017
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/538090
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (10)
Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms ⋮ A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts ⋮ Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition ⋮ Manufacturing rescheduling after crisis or disaster-caused supply chain disruption ⋮ Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations ⋮ Scheduling on uniform machines with a conflict graph: complexity and resolution ⋮ Primal Heuristics for Branch and Price: The Assets of Diving Methods ⋮ Minimizing the maximal ergonomic burden in intra-hospital patient transportation ⋮ Scheduling identical jobs on uniform machines with a conflict graph ⋮ Pickup and delivery problem with incompatibility constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
- Optimal solutions for a dock assignment problem with trailer transportation
- Scheduling with conflicts: Online and offline algorithms
- An exact algorithm for the maximum clique problem
- Mutual exclusion scheduling with interval graphs or related classes. I
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- Scheduling with incompatible jobs
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Scheduling with conflicts on bipartite and interval graphs
- An algorithm for the disjunctively constrained knapsack problem
- Column Generation based Primal Heuristics
- Algorithms for the Bin Packing Problem with Conflicts
- A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
- A Metaheuristic Approach for the Vertex Coloring Problem
- Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
- Conflict Resolution in the Scheduling of Television Commercials
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- The Knapsack Problem with Conflict Graphs
- A Linear Programming Approach to the Cutting-Stock Problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- New methods to color the vertices of a graph
- A Column Generation Approach for Graph Coloring
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- Optimal Scheduling of Tasks on Identical Parallel Processors
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: An exact algorithm for parallel machine scheduling with conflicts
