Exact algorithms for scheduling multiple families of jobs on parallel machines
From MaRDI portal
Publication:4456097
Recommendations
- Scheduling job families on non-identical parallel machines with time constraints
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling
- Dynamic programming algorithms for scheduling parallel machines with family setup times
- Approximation algorithms for scheduling parallel jobs
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- An exact algorithm for parallel machine scheduling with conflicts
- On the exact solution of a large class of parallel machine scheduling problems
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Simultaneous job scheduling and resource allocation on parallel machines
Cited in
(20)- A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production
- Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types
- A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines
- A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- 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
- Scheduling continuous aluminium casting lines
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times
- A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
- An exact branch-and-price algorithm for multitasking scheduling on unrelated parallel machines
- A survey of scheduling problems with setup times or costs
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
- Dynamic programming algorithms for scheduling parallel machines with family setup times
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
This page was built for publication: Exact algorithms for scheduling multiple families of jobs on parallel machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4456097)
