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

DOI10.1016/0166-218X(95)00051-RMaRDI QIDQ1917355zbMATH OpenOpenAlexFDO

Authors 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

Emmons' dominance theoremone-machine schedulingpartial order on a job setproper augmentationstotal tardiness

Mathematics Subject Classification ID

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

Recommendations

• One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons
• New Precedence Theorems for One-Machine Weighted Tardiness
• Un nouveau concept de dominance pour l'ordonnancement de travaux sur une machine
• On decomposition of the total tardiness problem
• Erratum: One machine sequencing to minimize total tardiness: a fourth theorem for Emmons

Cites work

• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• scientific article; zbMATH DE number 3873052 (Why is no real title available?)
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness

Cited in

(4)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917355)