Dynamic programming algorithms for scheduling parallel machines with family setup times

DOI10.1016/S0305-0548(99)00094-5zbMath0990.90052OpenAlexW2059244936MaRDI QIDQ5926032

Azizoglu, Meral, Webster, Scott

Publication date: 12 March 2001

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00094-5

zbMATH Keywords

production scheduling

Mathematics Subject Classification ID

Stochastic scheduling theory in operations research (90B36) Dynamic programming (90C39)

Related Items

Unrelated parallel machine scheduling with new criteria: complexity and models, An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times, A survey of scheduling problems with setup times or costs, Scheduling rules to minimize total tardiness in a parallel machine problem with setup and calendar constraints, 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, A heuristic hybrid framework for vector job scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Single facility multi-class job scheduling
• A new dynamic programming algorithm for the parallel machines total weighted completion time problem
• The complexity of scheduling job families about a common due date
• On the Complexity of Scheduling with Batch Setup Times
• Scheduling independent tasks to reduce mean finishing time
• Scheduling Groups of Jobs on a Single Machine
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems