A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work
From MaRDI portal
Publication:5024913
DOI10.1142/S021759592150007XzbMath1481.90167OpenAlexW3127009681MaRDI QIDQ5024913
Yunhong Min, Byung-Cheon Choi, Myoung-Ju Park, Kyung Min Kim
Publication date: 1 February 2022
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s021759592150007x
Related Items
Approximation algorithms for the maximum bounded connected bipartition problem, A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work, Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
Cites Work
- Unnamed Item
- Notes on inverse bin-packing problems
- Survey of scheduling research involving due date determination decisions
- 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
- 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 to Minimize Total Late Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- Single Machine Scheduling to Minimize Total Weighted Late Work