On the exact solution of a large class of parallel machine scheduling problems
From MaRDI portal
Publication:2197322
Recommendations
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
- Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times
Cites work
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- A strong preemptive relaxation for weighted tardiness and earliness/tardiness problems on unrelated parallel machines
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- An exact algorithm for single-machine scheduling without machine idle time
- An exact algorithm for the single-machine total weighted tardiness problem with sequence-dependent setup times
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems
- Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates
- Earliness-tardiness scheduling with setup considerations
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 7124428 (Why is no real title available?)
- Improved branch-cut-and-price for capacitated vehicle routing
- Minimizing total tardiness in an unrelated parallel-machine scheduling problem
- Near-optimal solutions of large-scale single-machine scheduling problems
- New enhancements for the exact solution of the vehicle routing problem with time windows
- New route relaxation and pricing strategies for the vehicle routing problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling on parallel identical machines to minimize total tardiness
- Scheduling unrelated parallel machines to minimize total weighted tardiness.
- Solving Parallel Machine Scheduling Problems by Column Generation
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- The one-machine problem with earliness and tardiness penalties
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
Cited in
(20)- Improved bounds on relaxations of a parallel machine scheduling problem
- Exact methods for order acceptance and scheduling on unrelated parallel machines
- A PTAS for a resource scheduling problem with arbitrary number of parallel machines
- A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- An exact framework for the discrete parallel machine scheduling location problem
- Heuristic and exact algorithms for the identical parallel machine scheduling problem
- A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
- Exact algorithms for scheduling multiple families of jobs on parallel machines
- scientific article; zbMATH DE number 1783886 (Why is no real title available?)
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines
- A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines
- Dynamic scheduling of patients in emergency departments
- Exact algorithm over an arc-time-indexed formulation 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
- New cuts and a branch-cut-and-price model for the multi-vehicle covering tour problem
- Unrelated parallel machine scheduling with random rework and limited preemption
- Models and algorithms for configuring and testing prototype cars
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
This page was built for publication: On the exact solution of a large class of parallel machine scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197322)
