A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
From MaRDI portal
Publication:3423262
Recommendations
- A GRASP for parallel machine scheduling with time windows
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Algorithms for parallel machine scheduling: a case study of the tracking and data relay satellite system
- On the exact solution of a large class of parallel machine scheduling problems
- Parallel machine scheduling by column generation
Cited in
(20)- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones
- 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 multitasking scheduling on unrelated parallel machines
- A GRASP for parallel machine scheduling with time windows
- Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling
- Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
- On the exact solution of a large class of parallel machine scheduling problems
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
- Scheduling multiple products on parallel machines with setup costs
- Solving the selective multi-category parallel-servicing problem
- The concrete delivery problem
- Accelerating the branch-and-price algorithm using machine learning
- Optimal solutions for a dock assignment problem with trailer transportation
- A branch-and-price algorithm for stable workforce assignments with hierarchical skills
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines
- 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
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
This page was built for publication: A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3423262)