Scheduling with state-dependent machine speed

DOI10.1007/978-3-319-28684-6_17MaRDI QIDQ2789002zbMATH OpenOpenAlexFDO

Authors Veerle Timmermans, T. Vredeveld

Publication date 26 February 2016

Published in Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28684-6_17

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Scheduling start time dependent jobs to minimize the total weighted completion time
• A note on scheduling on a single processor with speed dependent on a number of executed jobs
• Scheduling on a single processor with variable speed
• scientific article; zbMATH DE number 4072697
• Dual techniques for scheduling on a machine with varying speed

Cited in

(4)

• Approximation algorithms for some position-dependent scheduling problems
• Two-agent scheduling problems with the general position-dependent processing time
• Scheduling in a single-server queue with state-dependent service rates
• Theory and methodology of time-dependent scheduling: past, present and future

This page was built for publication: Scheduling with state-dependent machine speed

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2789002)