A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines

DOI10.1137/110843836zbMath1267.90057OpenAlexW2032653627WikidataQ59902112 ScholiaQ59902112MaRDI QIDQ5300489

Natalia V. Shakhlevich, Akiyoshi Shioura, Vitaly 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

controllable processing timesbicriteria problemssubmodular optimizationparallel machine schedulling

Mathematics Subject Classification ID

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

Related Items

Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost, Throughput optimization for the Robotic Cell Problem with Controllable Processing Times, Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints, 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, 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