Decomposition of the single machine total tardiness problem

DOI10.1016/S0167-6377(96)00031-4zbMATH Open0874.90108OpenAlexW2077281181MaRDI QIDQ1362989FDOQ1362989

Samar K. Mukhopadhyay, Wlodzimierz Szwarc

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)

Cites Work

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

Cited In (19)

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

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• The single-machine total tardiness scheduling problem: review and extensions 👍 👎

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)