Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
type: Item
instance of: scholarly article
title: Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
zbMATH Open document ID: 1327.90267
author: Akiyoshi Shioura
author: N. V. Shakhlevich
author: V. A. Strusevich
published in: Mathematical Programming. Series A. Series B
publication date: 2015-10-19T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6495760
zbMATH Keywords: submodular optimization
zbMATH Keywords: parallel machine scheduling
zbMATH Keywords: controllable processing times
zbMATH Keywords: decomposition
MaRDI profile type: Publication
full work available at URL: s10107-014-0814-9
OpenAlex ID: W2067598904
Wikidata QID: Q59404568
cites work: Q3425131
cites work: Scheduling jobs to minimize total cost
cites work: Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
cites work: Submodular functions and optimization.
cites work: Preemptive Scheduling of Uniform Processor Systems
cites work: Two algorithms for maximizing a separable concave function over a polymatroid feasible region
cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
cites work: Single machine scheduling subject to deadlines and resource dependent processing times
cites work: Approximation schemes for parallel machine scheduling problems with controllable processing times
cites work: Q4247449
cites work: Preemptive Scheduling with Due Dates
cites work: Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
cites work: Scheduling with deadlines and loss functions
cites work: Q4040221
cites work: A survey of results for sequencing problems with controllable processing times
cites work: A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
cites work: Scheduling Independent Tasks with Due Times on a Uniform Processor System
cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: A survey of scheduling with controllable processing times
cites work: Pre-emptive scheduling problems with controllable processing times
cites work: Preemptive scheduling on uniform parallel machines with controllable job processing times
cites work: SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
cites work: Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach
cites work: A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines
DOI: 10.1007/S10107-014-0814-9
description: scientific article; zbMATH DE number 6495760