Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness

DOI10.1023/A:1015487829051zbMATH Open1014.90039OpenAlexW1489262994WikidataQ57633944 ScholiaQ57633944MaRDI QIDQ1850992FDOQ1850992

M. Y. Kovalyov, Frank Werner

Publication date: 15 December 2002

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1015487829051

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

zbMATH Keywords

approximationtotal tardinessparallel machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Cited In (18)

• Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
• A common approximation framework for early work, late work, and resource leveling problems
• Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty
• A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines
• Title not available (Why is that?)
• Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning
• Optimal due date assignment in multi-machine scheduling environments
• Notes on inverse bin-packing problems
• Optimal restricted due date assignment in scheduling
• Unrelated parallel machine scheduling problem with special controllable processing times and setups
• A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines
• Scheduling on parallel identical machines to minimize total tardiness
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments
• Heuristic algorithms for unrelated parallel machine scheduling with a common due date, release dates, and linear earliness and tardiness penalties
• Fair task allocation problem
• Approximation algorithms for scheduling a single machine to minimize total late work
• Minimizing the number of tardy jobs in two-machine settings with common due date

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)