An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times

DOI10.1016/j.camwa.2011.10.077zbMath1238.90068MaRDI QIDQ418297

Liang-Chuan Chen, Chien-Wen Chao, Ching-Jong Liao

Publication date: 28 May 2012

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.10.077

zbMATH Keywords

parallel machines; heuristic; family set-up times; weighted flowtime

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization, An efficient genetic algorithm for decentralized multi-project scheduling with resource transfers, Iterated greedy algorithms for a complex parallel machine scheduling problem

Cites Work

• Unnamed Item
• Single facility scheduling with multiple job classes
• Weighted flow time bounds for scheduling identical processors
• Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
• The complexity of scheduling job families about a common due date
• Heuristic methods for the identical parallel machine flowtime problem with set-up times
• Batch scheduling to minimize total completion time
• Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
• Single machine scheduling with exponential time-dependent learning effect and past-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
• A Review of Production Scheduling
• Exact algorithms for scheduling multiple families of jobs on parallel machines
• Scheduling parallel machines to minimize weighted flowtime with family set-up times
• Scheduling independent tasks to reduce mean finishing time
• A New Heuristic for a Single Machine Scheduling Problem with Set-up Times
• Dynamic programming algorithms for scheduling parallel machines with family setup times