A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work
DOI10.1007/s10288-022-00517-1zbMath1525.90215OpenAlexW4283166382MaRDI QIDQ6054012
Byung-Cheon Choi, Kyung Min Kim, Yunhong Min, Myoung-Ju Park
Publication date: 24 October 2023
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-022-00517-1
Analysis of algorithms and problem complexity (68Q25) Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- Unnamed Item
- Notes on inverse bin-packing problems
- Minimizing mean weighted execution time loss on identical and uniform processors
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
- 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
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Shared processor scheduling
- Faster algorithms for the shortest path problem
- A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work
This page was built for publication: A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work
