A Review for Submodular Optimization on Machine Scheduling Problems (Q3297835)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A Review for Submodular Optimization on Machine Scheduling Problems	scientific article

Statements

scholarly article

0 references

A Review for Submodular Optimization on Machine Scheduling Problems (English)

0 references

0 references

Complexity and Approximation

0 references

publication date

20 July 2020

0 references

zbMATH Keywords

submodular optimization

0 references

machine scheduling

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-41672-0_16

0 references

Sequencing unreliable jobs on parallel machines

0 references

Green scheduling, flows and matchings

0 references

Setup and Open-Stacks Minimization in One-Dimensional Stock Cutting

0 references

A research survey: review of flexible job shop scheduling techniques

0 references

Single machine scheduling with discretely controllable processing times

0 references

Optimal scheduling in film production to minimize talent hold cost

0 references

Parallel machine scheduling with additional resources: notation, classification, models and solution methods

0 references

Applications of modern heuristic search methods to pattern sequencing problems

0 references

On Submodular Search and Machine Scheduling

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

A Generalized Uniform Processor System

0 references

An analysis of approximations for maximizing submodular set functions—I

0 references

A survey of results for sequencing problems with controllable processing times

0 references

An improved heuristic for parallel machine scheduling with rejection

0 references

Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan

0 references

Minimizing the total weighted flow time in a single machine with controllable processing times

0 references

A survey of scheduling with controllable processing times

0 references

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES BY SUBMODULAR OPTIMIZATION

0 references

Pre-emptive scheduling problems with controllable processing times

0 references

Preemptive scheduling on uniform parallel machines with controllable job processing times

0 references

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

0 references

Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times

0 references

Application of Submodular Optimization to Single Machine Scheduling with Controllable Processing Times Subject to Release Dates and Deadlines

0 references

Handling Scheduling Problems with Controllable Parameters by Methods of Submodular Optimization

0 references

Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints

0 references

Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches

0 references

Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost

0 references

0 references

Approximation schemes for two-agent scheduling on parallel machines

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-41672-0_16

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3297835

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3297835&oldid=36601622"