Parallel machine scheduling considering a job-splitting property

DOI10.1080/00207540410001720745zbMath1060.90038OpenAlexW1979805465MaRDI QIDQ4671338

No author found.

Publication date: 26 April 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540410001720745

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items (4)

Resource loading with time windows ⋮ Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness ⋮ A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property ⋮ Scheduling uniform parallel dedicated machines with job splitting, sequence-dependent setup times, and multiple servers

Cites Work

• Scheduling jobs on parallel machines with sequence-dependent setup times
• A heuristic for the single machine tardiness problem
• Scheduling parallel machines to minimize total weighted and unweighted tardiness
• Parallel machine scheduling with splitting jobs
• A backward approach in list scheduling algorithms for multi-machine tardiness problems
• An integrated inventory model for a single product and its raw materials
• 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
• Heuristics for minimizing mean tardiness form parallel machines
• Scheduling with Deadlines and Loss Functions on k Parallel Machines
• Scheduling Jobs on Several Machines with the Job Splitting Property

This page was built for publication: Parallel machine scheduling considering a job-splitting property