Parallel machine scheduling with speed-up resources

DOI10.1016/j.ejor.2018.01.037zbMath1403.90314OpenAlexW2792011312MaRDI QIDQ1754306

Lin Chen, Deshi Ye, Guo-Chuan Zhang

Publication date: 30 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2018.01.037

zbMATH Keywords

linear programmingschedulingapproximation algorithmresource allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (1)

Production, maintenance and resource scheduling: a review

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling under linear constraints
• Approximation algorithms for scheduling unrelated parallel machines
• Machine scheduling with resource dependent processing times
• An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
• Scheduling on two identical machines with a speed-up resource
• A survey of scheduling with controllable processing times
• Approximation schemes for job shop scheduling problems with controllable processing times
• An optimal rounding gives a better approximation for scheduling unrelated machines
• A Polynomial Time Approximation Scheme for General Multiprocessor Job Scheduling
• Scheduling with Deadlines and Loss Functions
• ONLINE SCHEDULING OF MIXED CPU-GPU JOBS
• Minkowski's Convex Body Theorem and Integer Programming
• Approximation schemes for machine scheduling with resource (in-)dependent processing times
• Scheduling parallel dedicated machines with the speeding‐up resource
• Improved Approximation Schemes for Scheduling Unrelated Parallel Machines

This page was built for publication: Parallel machine scheduling with speed-up resources