A heuristic algorithm to minimize total weighted tardiness on a single machine with release times

DOI10.1111/j.1475-3995.2005.00499.xzbMath1063.90026OpenAlexW1993368182MaRDI QIDQ4670675

Ching-En Lee, Tzu-Yun Chang, Fuh-Der Chou

Publication date: 22 April 2005

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2005.00499.x

zbMATH Keywords

single machine schedulingrelease timestotal weighted tardiness

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

Cites Work

• Dynamic non-preemptive single machine scheduling
• Generalized pairwise interchanges and machine scheduling
• A new lower bounding scheme for the total weighted tardiness problem.
• A new dominance rule to minimize total weighted tardiness with unequal release dates.

This page was built for publication: A heuristic algorithm to minimize total weighted tardiness on a single machine with release times