Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm

DOI10.1016/j.cor.2018.12.020zbMath1458.90346OpenAlexW2906405651MaRDI QIDQ1725624

Gerhard Rauchecker, Guido Schryen

Publication date: 14 February 2019

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

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

zbMATH Keywords

high performance computingmaster/worker parallelizationparallel branch-and-price algorithmparallel machine scheduling with setup times

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ The traveling salesman problem with job-times (\textit{TSPJ}) ⋮ A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• The third comprehensive survey on scheduling problems with setup times/costs
• A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
• Scheduling unrelated parallel machines with sequence-dependent setups
• A state-of-the-art review of parallel-machine scheduling research
• A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
• Parallel branch-and-bound methods for the job-shop scheduling problem
• Parallel branch, cut, and price for large-scale discrete optimization
• On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
• Emergency response in natural disaster management: allocation and scheduling of rescue units
• A survey of scheduling problems with setup times or costs
• Scheduling resource-constrained projects using branch-and-bound and parallel computing techniques
• Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking
• Heuristics, metaheuristics and approximate methods in planning and scheduling
• A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
• Parallel Machine Scheduling by Column Generation
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Decomposition Principle for Linear Programs
• A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5
• Solving Parallel Machine Scheduling Problems by Column Generation
• Exact algorithms for scheduling multiple families of jobs on parallel machines
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Selected Topics in Column Generation
• Scheduling

This page was built for publication: Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm