A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines

DOI10.1137/110843836MaRDI QIDQ5300489zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Akiyoshi Shioura, N. V. Shakhlevich, V. A. Strusevich

Publication date 27 June 2013

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL http://eprints.whiterose.ac.uk/78189/10/shakhlevich1.pdf

zbMATH Keywords

bicriteria problemscontrollable processing timesparallel machine schedullingsubmodular optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Combinatorial optimization (90C27)

Recommendations

• SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
• Handling scheduling problems with controllable parameters by methods of submodular optimization
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
• Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
• Pre-emptive scheduling problems with controllable processing times

Cited in

(13)

• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
• Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
• Handling scheduling problems with controllable parameters by methods of submodular optimization
• A Review for Submodular Optimization on Machine Scheduling Problems
• Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
• SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
• Throughput optimization for the robotic cell problem with controllable processing times
• On Submodular Search and Machine Scheduling
• Machine speed scaling by adapting methods for convex optimization with submodular constraints
• Preemptive scheduling of parallel jobs of two sizes with controllable processing times
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
• Bicriteria scheduling for contiguous and non contiguous parallel tasks

This page was built for publication: A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines

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