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.001zbMATH Open1113.90061OpenAlexW2002815701MaRDI QIDQ853028FDOQ853028
Manuel J. Pereira Lopes, José 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
Recommendations
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- A column generation for a parallel machine scheduling with sequence-dependent setup times
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
- On the exact solution of a large class of parallel machine scheduling problems
- A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- Title not available (Why is that?)
- Scheduling with batching: A review
- Selected Topics in Column Generation
- Stabilized column generation
- Branch-and-price: Column generation for solving huge integer programs
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Title not available (Why is that?)
- Decomposition Principle for Linear Programs
- Solving Parallel Machine Scheduling Problems by Column Generation
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- Parallel machine scheduling by column generation
- Using extra dual cuts to accelerate column generation
- Dual-Optimal Inequalities for Stabilized Column Generation
- State-space relaxation procedures for the computation of bounds to routing problems
- A proximal trust-region algorithm for column generation stabilization
- Parallel machine scheduling with a common due window
- Minimizing the number of tardy jobs for \(m\) parallel machines
- Title not available (Why is that?)
Cited In (23)
- Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates
- 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
- An exact branch-and-price algorithm for scheduling rescue units during disaster response
- 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
- Robust scheduling of parallel machines with sequence-dependent set-up costs
- On the exact solution of a large class of parallel machine scheduling problems
- A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates
- A branch and price algorithm for single-machine completion time variance
- Scheduling heating tasks on parallel furnaces with setup times and conflicts
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- 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
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times
- No-wait flexible flow shop scheduling with due windows
- A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- The one-dimensional cutting stock problem with sequence-dependent cut losses
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
Uses Software
This page was built for publication: A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853028)
