A Review for Submodular Optimization on Machine Scheduling Problems

DOI10.1007/978-3-030-41672-0_16MaRDI QIDQ3297835zbMATH OpenOpenAlexFDO

Authors S. W. Liu

Publication date 20 July 2020

Published in Complexity and Approximation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-41672-0_16

zbMATH Keywords

machine schedulingsubmodular optimization

Mathematics Subject Classification ID

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

Recommendations

• On Submodular Search and Machine Scheduling
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
• scientific article; zbMATH DE number 1302193
• SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
• Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
• A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines
• Revisiting branch and bound search strategies for machine scheduling problems
• Approximation algorithms for the multiprocessor scheduling with submodular penalties
• Algorithms for single machine scheduling problem with release dates and submodular penalties
• Approximation algorithm for the parallel-machine scheduling problem with release dates and submodular rejection penalties

Cites work

• A Generalized Uniform Processor System
• A research survey: review of flexible job shop scheduling techniques
• A submodular optimization approach to bicriteria scheduling problems with controllable processing times on parallel machines
• A survey of results for sequencing problems with controllable processing times
• A survey of scheduling with controllable processing times
• An analysis of approximations for maximizing submodular set functions—I
• An improved heuristic for parallel machine scheduling with rejection
• Application of submodular optimization to single machine scheduling with controllable processing times subject to release dates and deadlines
• Applications of modern heuristic search methods to pattern sequencing problems
• Approximation schemes for two-agent scheduling on parallel machines
• Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
• Green scheduling, flows and matchings
• Handling scheduling problems with controllable parameters by methods of submodular optimization
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Machine speed scaling by adapting methods for convex optimization with submodular constraints
• Minimizing the total weighted flow time in a single machine with controllable processing times
• On Submodular Search and Machine Scheduling
• Optimal scheduling in film production to minimize talent hold cost
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Parallel machine scheduling with additional resources: notation, classification, models and solution methods
• Pre-emptive scheduling problems with controllable processing times
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
• Preemptive scheduling on uniform parallel machines with controllable job processing times
• Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
• Sequencing unreliable jobs on parallel machines
• Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
• Setup and open-stacks minimization in one-dimensional stock cutting
• SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
• Single machine scheduling with discretely controllable processing times

Cited in

(9)

• Weighted completion time minimization for capacitated parallel machines
• A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems
• 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
• On a Reduction for a Class of Resource Allocation Problems
• On Submodular Search and Machine Scheduling
• Machine speed scaling by adapting methods for convex optimization with submodular constraints
• A theoretical and empirical study of job scheduling in cloud computing environments: the weighted completion time minimization problem with capacitated parallel machines
• Scalable distributed algorithms for size-constrained submodular maximization in the MapReduce and adaptive complexity models

This page was built for publication: A Review for Submodular Optimization on Machine Scheduling Problems

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