Exact algorithms for scheduling multiple families of jobs on parallel machines
From MaRDI portal
Publication:4456097
DOI10.1002/NAV.10091zbMATH Open1044.90033OpenAlexW1983082255MaRDI QIDQ4456097FDOQ4456097
Publication date: 15 March 2004
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.10091
branch and boundcolumn generationsetup timesparallel machine schedulingset partitioning type formulation
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
Cited In (18)
- 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
- Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
- Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types
- An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
- A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry
- An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
- A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
- Dynamic programming algorithms for scheduling parallel machines with family setup times
- An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times
- An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem
- Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization
- A branchโandโprice approach to the multitasking scheduling with batch control on parallel machines
- A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
- A survey of scheduling problems with setup times or costs
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Scheduling continuous aluminium casting lines
- A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production
- Minimizing the weighted number of tardy jobs on multiple machines: a review
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 ๐ ๐
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)