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

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

Sang-Oh Shim, Yeong-Dae Kim

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

schedulingparallel machinesbranch and boundtotal tardinessjob splitting

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Scheduling with job-splitting considering learning and the vital-few law ⋮ Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm ⋮ Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness ⋮ A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations ⋮ Two branch-and-bound algorithms for the robust parallel machine scheduling problem ⋮ Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers ⋮ A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times ⋮ Batch sizing and just-in-time scheduling with common due date ⋮ Planning production using mathematical programming: The case of a woodturning company ⋮ A Multiobjective Optimization Approach to Solve a Parallel Machines Scheduling Problem

Cites Work

• 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
• Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
• Parallel machine scheduling considering a job-splitting property
• Heuristics for minimizing mean tardiness form parallel machines
• Scheduling with Deadlines and Loss Functions on k Parallel Machines
• The customer order lead-time problem on parallel machines
• Scheduling Jobs on Several Machines with the Job Splitting Property

This page was built for publication: A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property