A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property

DOI10.1016/j.cor.2006.04.006zbMath1278.90174MaRDI QIDQ2456645

Yeong-Dae Kim, Sang-Oh Shim

Publication date: 19 October 2007

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

Full work available at URL: https://doi.org/10.1016/j.cor.2006.04.006

zbMATH Keywords

scheduling; parallel machines; branch and bound; total tardiness; job splitting

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

Related Items

Planning production using mathematical programming: The case of a woodturning company

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Branch and bound algorithm for the flow shop with multiple processors
• Scheduling parallel machines for the customer order problem
• Minimizing total tardiness in permutation flowshops
• Scheduling jobs on parallel machines with sequence-dependent setup times
• Scheduling parallel machines to minimize total weighted and unweighted tardiness
• Scheduling unrelated parallel machines to minimize total weighted tardiness.
• Parallel machine scheduling with splitting jobs
• A backward approach in list scheduling algorithms for multi-machine tardiness problems
• Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
• Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
• Parallel machine scheduling considering a job-splitting property
• Scheduling with Deadlines and Loss Functions on k Parallel Machines
• Scheduling Jobs on Several Machines with the Job Splitting Property