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

DOI10.1137/110843836zbMATH Open1267.90057DBLPjournals/siamdm/ShiouraSS13OpenAlexW2032653627WikidataQ59902112 ScholiaQ59902112MaRDI QIDQ5300489FDOQ5300489

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

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

zbMATH Keywords

controllable processing timesbicriteria problemssubmodular optimizationparallel machine schedulling

Mathematics Subject Classification ID

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

Cited In (13)

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

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)