A parallel machine scheduling problem maximizing total weighted early work
From MaRDI portal
Recommendations
- Single machine scheduling problem with minimize total weighted early work
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- A note on multimachine scheduling with weighted early/late work criteria and common due date
- A single machine scheduling problem to minimize total early work
Cites work
- A common approximation framework for early work, late work, and resource leveling problems
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- Notes on inverse bin-packing problems
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Single Machine Scheduling to Minimize Total Late Work
- Single Machine Scheduling to Minimize Total Weighted Late Work
- Survey of scheduling research involving due date determination decisions
Cited in
(15)- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Mirror scheduling problems with early work and late work criteria
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
- Two-machine flow shop scheduling with a common due date to maximize total early work
- Approximation algorithms for the maximum bounded connected bipartition problem
- A common approximation framework for early work, late work, and resource leveling problems
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Single machine scheduling problem with minimize total weighted early work
- A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work
- Maximizing total early work in a distributed two‐machine flow‐shop
- A note on multimachine scheduling with weighted early/late work criteria and common due date
- Improved approximation schemes for early work scheduling on identical parallel machines with a common due date
- Scheduling with assignable due dates, two competing agents and late work related criteria
- The minmax regret scheduling-location problem on trees with interval-data edge lengths
- Approximation schemes for parallel machine scheduling to maximize total weighted early work with a common due date
This page was built for publication: A parallel machine scheduling problem maximizing total weighted early work
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024913)
