A Review for Submodular Optimization on Machine Scheduling Problems
From MaRDI portal
Publication:3297835
DOI10.1007/978-3-030-41672-0_16zbMath1440.90009OpenAlexW3007103704MaRDI QIDQ3297835
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
Related Items (3)
A new performance bound for submodular maximization problems and its application to multi-agent optimal coverage problems ⋮ On a Reduction for a Class of Resource Allocation Problems ⋮ Weighted completion time minimization for capacitated parallel machines
Cites Work
- Unnamed Item
- Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times
- Sequencing unreliable jobs on parallel machines
- Pre-emptive scheduling problems with controllable processing times
- A survey of results for sequencing problems with controllable processing times
- Preemptive scheduling on uniform parallel machines with controllable job processing times
- Applications of modern heuristic search methods to pattern sequencing problems
- Optimal scheduling in film production to minimize talent hold cost
- Single machine scheduling with discretely controllable processing times
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Approximation schemes for two-agent scheduling on parallel machines
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- Green scheduling, flows and matchings
- Parallel machine scheduling with additional resources: notation, classification, models and solution methods
- A survey of scheduling with controllable processing times
- 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
- A research survey: review of flexible job shop scheduling techniques
- Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting
- Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization
- SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION
- A Generalized Uniform Processor System
- An analysis of approximations for maximizing submodular set functions—I
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- On Submodular Search and Machine Scheduling
- Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints
- A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel Machines
This page was built for publication: A Review for Submodular Optimization on Machine Scheduling Problems
