Scheduling parallel machines to minimize weighted flowtime with family set-up times

DOI10.1080/0020754021000042959zbMath1063.90025OpenAlexW1996516917MaRDI QIDQ4665277

Azizoglu, Meral, Webster, Scott

Publication date: 9 April 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020754021000042959

zbMATH Keywords

branch-and-bound algorithmsmachine scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Parallel machine scheduling with preference of machines, An improved heuristic for parallel machine weighted flowtime scheduling with family set-up 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, Heuristic methods for the identical parallel machine flowtime problem with set-up 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