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

DOI10.1016/j.cor.2021.105464OpenAlexW3180737498MaRDI QIDQ2669559

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

schedulingbranch-and-priceconflict graphidentical parallel machineagreement graph

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items

Scheduling on uniform machines with a conflict graph: complexity and resolution

Uses Software

• CPU Benchmarks

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal solutions for a dock assignment problem with trailer transportation
• Scheduling with conflicts: Online and offline algorithms
• Scheduling with incompatible jobs
• On the capacitated vehicle routing problem
• Makespan minimization on unrelated parallel machines with a few bags
• Scheduling identical jobs on uniform machines with a conflict graph
• An exact algorithm for parallel machine scheduling with conflicts
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Column Generation based Primal Heuristics
• Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem
• The Knapsack Problem with Conflict Graphs
• Tight bounds for the identical parallel machine‐scheduling problem: Part II
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Optimal Scheduling of Tasks on Identical Parallel Processors
• A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
• Column Generation
• Selected Topics in Column Generation
• Shortest Path Problems with Resource Constraints