A common approximation framework for early work, late work, and resource leveling problems
From MaRDI portal
Publication:2184097
DOI10.1016/j.ejor.2020.03.032zbMath1443.90181arXiv1909.11086OpenAlexW2975508967MaRDI QIDQ2184097
Publication date: 27 May 2020
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.11086
Related Items (5)
Approximation algorithms for the maximum bounded connected bipartition problem ⋮ Scheduling with competing agents, total late work and job rejection ⋮ Combinatorial approximation algorithms for the maximum bounded connected bipartition problem ⋮ A Parallel Machine Scheduling Problem Maximizing Total Weighted Early Work ⋮ Two-machine flow shop scheduling with a common due date to maximize total early work
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Resource leveling in a machine environment
- A note on the two machine job shop with the weighted late work criterion
- Approximation algorithms for scheduling a single machine to minimize total late work
- Open shop scheduling problems with late work criteria.
- Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
- 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
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
- Mixed-integer linear programming for resource leveling problems
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- A metaheuristic solution approach for the time-constrained project scheduling problem
- A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
- A comment on scheduling two parallel machines with capacity constraints
- 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
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: A common approximation framework for early work, late work, and resource leveling problems
