Scheduling parallel dedicated machines with the speeding‐up resource

DOI10.1002/nav.20292zbMath1209.90174OpenAlexW2137796607MaRDI QIDQ5393022

Hans Kellerer, Vitaly A. Strusevich

Publication date: 15 April 2011

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20292

zbMATH Keywords

complexityschedulingapproximationresource constraintsparallel dedicated machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ ONLINE SCHEDULING OF MIXED CPU-GPU JOBS ⋮ Scheduling on two identical machines with a speed-up resource ⋮ An improved algorithm for parallel machine scheduling under additional resource constraints ⋮ Restricted assignment scheduling with resource constraints ⋮ Approximation algorithms for scheduling on multi-core processor with shared speedup resources ⋮ Parallel machine scheduling with speed-up resources ⋮ Online Scheduling on a CPU-GPU Cluster ⋮ A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions ⋮ Scheduling jobs with time-resource tradeoff via nonlinear programming ⋮ Scheduling incompatible tasks on two machines ⋮ Production, maintenance and resource scheduling: a review ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Machine scheduling with resource dependent processing times
• A survey of results for sequencing problems with controllable processing times
• Single machine scheduling subject to deadlines and resource dependent processing times
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• Scheduling parallel dedicated machines under a single non-shared resource
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
• Parallel machine scheduling with a convex resource consumption function

This page was built for publication: Scheduling parallel dedicated machines with the speeding‐up resource