Decomposition of the single machine total tardiness problem

DOI10.1016/S0167-6377(96)00031-4MaRDI QIDQ1362989zbMATH OpenOpenAlexFDO

Authors Wlodzimierz Szwarc, Samar K. Mukhopadhyay

Publication date 7 August 1997

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-6377(96)00031-4

zbMATH Keywords

decompositionbranch and boundsingle machine total tardiness problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Some remarks on the decomposition properties of the single machine total tardiness problem
• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• A new decomposition approach for the single machine total tardiness scheduling problem
• On the single machine total tardiness problem
• Solution of the single machine total tardiness problem
• On decomposition of the total tardiness problem
• Single machine total tardiness maximization problems: complexity and algorithms
• New insights on the single machine total tardiness problem
• scientific article; zbMATH DE number 1076139
• The single-machine total tardiness scheduling problem: review and extensions

Cites work

• scientific article; zbMATH DE number 40477 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• A decomposition algorithm for the single machine total tardiness problem
• A dual algorithm for the one-machine scheduling problem
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
• Minimizing Total Costs in One-Machine Scheduling
• Minimizing Total Tardiness on One Machine is NP-Hard
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness

Cited in

(22)

• Solution of the single machine total tardiness problem
• Moderate exponential-time algorithms for scheduling problems
• Algorithmic paradoxes of the single-machine total tardiness problem
• On decomposition of the total tardiness problem
• Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem
• The job shop tardiness problem: A decomposition approach
• New insights on the single machine total tardiness problem
• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
• Some remarks on the decomposition properties of the single machine total tardiness problem
• The single-machine total tardiness scheduling problem: review and extensions
• A new decomposition approach for the single machine total tardiness scheduling problem
• Performance-extending approaches for total tardiness scheduling problem on one machine
• Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness
• The Single Machine Early/Tardy Problem
• An exact exponential branch-and-merge algorithm for the single machine total tardiness problem
• Minimizing total tardiness in a scheduling problem with a learning effect
• Merging nodes in search trees: an exact exponential algorithm for the single machine total tardiness scheduling problem
• Erratum: One machine sequencing to minimize total tardiness: a fourth theorem for Emmons
• Insights into two solution procedures for the single machine tardiness problem
• The single-machine absolute-deviation early-tardy problem with random completion times
• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine

This page was built for publication: Decomposition of the single machine total tardiness problem

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