A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
DOI10.1016/J.COR.2006.04.006zbMATH Open1278.90174OpenAlexW2026951037MaRDI QIDQ2456645FDOQ2456645
Authors: 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
Recommendations
- Parallel machine scheduling considering a job-splitting property
- Scheduling on parallel identical machines to minimize total tardiness
- Scheduling Jobs on Several Machines with the Job Splitting Property
- Minimizing total tardiness in an unrelated parallel-machine scheduling problem
- Parallel machine scheduling with splitting jobs
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- 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
- Parallel machine scheduling considering a job-splitting property
- Scheduling Jobs on Several Machines with the Job Splitting Property
- Minimizing total tardiness in permutation flowshops
- Title not available (Why is that?)
- Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem
- Branch and bound algorithm for the flow shop with multiple processors
- Heuristics for minimizing mean tardiness form parallel machines
- Scheduling parallel machines for the customer order problem
- Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights
- Scheduling with Deadlines and Loss Functions on k Parallel Machines
- Evaluation of a Heuristic for Scheduling Independent Jobs on Parallel Identical Processors
- The customer order lead-time problem on parallel machines
Cited In (14)
- A multiobjective optimization approach to solve a parallel machines scheduling problem
- A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
- Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking
- A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
- Parallel machine scheduling considering a job-splitting property
- Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers
- Planning production using mathematical programming: The case of a woodturning company
- Scheduling with job-splitting considering learning and the vital-few law
- Two branch-and-bound algorithms for the robust parallel machine scheduling problem
- Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness
- Parallel machine scheduling with splitting jobs by a hybrid differential evolution algorithm
- Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm
- Batch sizing and just-in-time scheduling with common due date
- A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
This page was built for publication: A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456645)
