A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
From MaRDI portal
(Redirected from Publication:853028)
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
Cites work
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 1175952 (Why is no real title available?)
- scientific article; zbMATH DE number 956787 (Why is no real title available?)
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
- A proximal trust-region algorithm for column generation stabilization
- Branch-and-price: Column generation for solving huge integer programs
- Decomposition Principle for Linear Programs
- Dual-Optimal Inequalities for Stabilized Column Generation
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- Minimizing the number of tardy jobs for \(m\) parallel machines
- Network flows. Theory, algorithms, and applications.
- Parallel machine scheduling by column generation
- Parallel machine scheduling with a common due window
- Scheduling with batching: A review
- Selected Topics in Column Generation
- Solving Parallel Machine Scheduling Problems by Column Generation
- Stabilized column generation
- State-space relaxation procedures for the computation of bounds to routing problems
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- Using extra dual cuts to accelerate column generation
Cited in
(36)- Petri net scheduling of parallel manufacturing systems based on a new branch and bound algorithm
- A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
- Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- A branch-and-price algorithm for the general case of scheduling parallel machines with a single server
- Timed route approaches for large multi-product multi-step capacitated production planning problems
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- The one-dimensional cutting stock problem with sequence-dependent cut losses
- An exact branch-and-price algorithm for scheduling rescue units during disaster response
- Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- Scheduling heating tasks on parallel furnaces with setup times and conflicts
- 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
- Using PBIL to minimize makespan for parallel machines scheduling problem with job sequence dependent setup time
- A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine
- A branch and price algorithm for single-machine completion time variance
- Parallel machine scheduling with precedence constraints and setup times
- A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
- A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
- A new Lagrangian relaxation algorithm for scheduling dissimilar parallel machines with release dates
- An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines
- The third comprehensive survey on scheduling problems with setup times/costs
- Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
- Robust scheduling of parallel machines with sequence-dependent set-up costs
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones
- No-wait flexible flow shop scheduling with due windows
- On the exact solution of a large class of parallel machine scheduling problems
- Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines
- A column generation for a parallel machine scheduling with sequence-dependent setup times
- 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
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)
