Augmentations of consistent partial orders for the one-machine total tardiness problem

DOI10.1016/0166-218X(95)00051-RzbMath0846.90058OpenAlexW2160800316MaRDI QIDQ1917355

Wen-Ci Yu

Publication date: 7 July 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(95)00051-r

zbMATH Keywords

total tardinessone-machine schedulingEmmons' dominance theorempartial order on a job setproper augmentations

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Necessary and sufficient conditions of optimality for some classical scheduling problems ⋮ A theoretical development for the total tardiness problem and its application in branch and bound algorithms ⋮ Minimizing total tardiness in a scheduling problem with a learning effect ⋮ The single-machine total tardiness scheduling problem: review and extensions

Cites Work

• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Unnamed Item

This page was built for publication: Augmentations of consistent partial orders for the one-machine total tardiness problem