Exact algorithms for scheduling multiple families of jobs on parallel machines
From MaRDI portal
Publication:4456097
DOI10.1002/nav.10091zbMath1044.90033OpenAlexW1983082255MaRDI QIDQ4456097
Warren B. Powell, Zhi-Long Chen
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
column generationbranch and boundparallel machine schedulingsetup timesset partitioning type formulation
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items
Minimizing the weighted number of tardy jobs on multiple machines: a review, Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types, A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times, An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem, A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry, A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines, An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times, Scheduling continuous aluminium casting lines, 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, A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production, A survey of scheduling problems with setup times or costs, An ant colony optimization algorithm for load balancing in parallel machines with sequence-dependent setup times, Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization, A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times, An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
Cites Work
