A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
From MaRDI portal
Publication:853028
DOI10.1016/j.ejor.2005.11.001zbMath1113.90061OpenAlexW2002815701MaRDI QIDQ853028
Manuel J. Pereira Lopes, José M. Valério de Carvalho
Publication date: 15 November 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.001
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (18)
The third comprehensive survey on scheduling problems with setup times/costs ⋮ A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine ⋮ No-wait flexible flow shop scheduling with due windows ⋮ Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times ⋮ A branch-and-price algorithm for the aperiodic multi-period service scheduling problem ⋮ Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network ⋮ On the exact solution of a large class of parallel machine scheduling problems ⋮ 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 ⋮ A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching ⋮ An exact branch-and-price algorithm for scheduling rescue units during disaster response ⋮ Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization ⋮ The one-dimensional cutting stock problem with sequence-dependent cut losses ⋮ Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines ⋮ A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times ⋮ An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems ⋮ Timed route approaches for large multi-product multi-step capacitated production planning problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing the number of tardy jobs for \(m\) parallel machines
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- Stabilized column generation
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- Scheduling with batching: A review
- A proximal trust-region algorithm for column generation stabilization
- Parallel Machine Scheduling by Column Generation
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Using Extra Dual Cuts to Accelerate Column Generation
- Decomposition Principle for Linear Programs
- Dual-Optimal Inequalities for Stabilized Column Generation
- State-space relaxation procedures for the computation of bounds to routing problems
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Solving Parallel Machine Scheduling Problems by Column Generation
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- Selected Topics in Column Generation
- Parallel machine scheduling with a common due window
This page was built for publication: A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
