Handling scheduling problems with controllable parameters by methods of submodular optimization

DOI10.1007/978-3-319-44914-2_7zbMATH Open1385.90009OpenAlexW2559441328WikidataQ59892339 ScholiaQ59892339MaRDI QIDQ3133202FDOQ3133202

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

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: http://eprints.whiterose.ac.uk/102830/7/repository4.pdf

Recommendations

• SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
• A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines
• 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
• A Review for Submodular Optimization on Machine Scheduling Problems

zbMATH Keywords

schedulingsubmodular polyhedroncontrollable parameters

Mathematics Subject Classification ID

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

Cited In (5)

• A Review for Submodular Optimization on Machine Scheduling Problems
• Submodular returns and greedy heuristics for queueing scheduling problems
• SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
• A subgradient descent algorithm for optimization of initially controllable flow shop systems
• On Submodular Search and Machine Scheduling

This page was built for publication: Handling scheduling problems with controllable parameters by methods of submodular optimization

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