A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts

DOI10.1016/J.COR.2021.105464MaRDI QIDQ2669559zbMATH OpenOpenAlexFDO

Authors Emanuele Tresoldi, Nicola Bianchessi

Publication date 9 March 2022

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

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

zbMATH Keywords

agreement graphbranch-and-priceconflict graphidentical parallel machinescheduling

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• An exact algorithm for parallel machine scheduling with conflicts
• Scheduling identical jobs on uniform machines with a conflict graph
• Flow shop scheduling problem with conflict graphs
• Scheduling jobs within time windows on identical parallel machines: New model and algorithms
• Open shop scheduling problems with conflict graphs

Cites work

• A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
• An exact algorithm for parallel machine scheduling with conflicts
• Branch-and-price: Column generation for solving huge integer programs
• Column Generation
• Column generation based primal heuristics
• Heuristic and exact algorithms for the identical parallel machine scheduling problem
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• Makespan minimization on unrelated parallel machines with a few bags
• On the capacitated vehicle routing problem
• Optimal Scheduling of Tasks on Identical Parallel Processors
• Optimal solutions for a dock assignment problem with trailer transportation
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling identical jobs on uniform machines with a conflict graph
• Scheduling with conflicts: Online and offline algorithms
• Scheduling with incompatible jobs
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints
• The Knapsack Problem with Conflict Graphs
• Tight bounds for the identical parallel machine‐scheduling problem: Part II

Cited in

(7)

• Scheduling identical jobs on uniform machines with a conflict graph
• An exact algorithm for parallel machine scheduling with conflicts
• An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
• Scheduling on uniform machines with a conflict graph: complexity and resolution
• A branch-and-price algorithm for the single machine scheduling problem with periodic maintenance to minimize makespan
• Compact formulations and valid inequalities for parallel machine scheduling with conflicts
• Models and algorithms for configuring and testing prototype cars

Describes a project that uses

Uses Software

• CPU Benchmarks

This page was built for publication: A stand-alone branch-and-price algorithm for identical parallel machine scheduling with conflicts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2669559)