Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
From MaRDI portal
(Redirected from Publication:1850992)
Recommendations
- scientific article; zbMATH DE number 853068
- Due-date assignment and early/tardy scheduling on identical parallel machines
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
Cited in
(19)- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
- Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
- A common approximation framework for early work, late work, and resource leveling problems
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- scientific article; zbMATH DE number 4059106 (Why is no real title available?)
- A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
- Approximation algorithms for scheduling a single machine to minimize total late work
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- Scheduling on parallel identical machines to minimize total tardiness
- Minimizing the number of tardy jobs in two-machine settings with common due date
- Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
- Optimal due date assignment in multi-machine scheduling environments
- Optimal restricted due date assignment in scheduling
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- Fair task allocation problem
- A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
- Notes on inverse bin-packing problems
This page was built for publication: Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1850992)
