On the Single-machine Scheduling Problem with Tardiness Penalties

DOI10.1057/JORS.1991.135MaRDI QIDQ3983490zbMATH OpenOpenAlexFDO

Authors Tapan Sen, Bolindra N. Borah

Publication date 27 June 1992

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1991.135

zbMATH Keywords

\(n\)-job, single-machine total tardiness problembranching algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• scientific article; zbMATH DE number 1076139
• A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• A theoretical development for the total tardiness problem and its application in branch and bound algorithms

Cited in

(14)

• The stochastic single machine scheduling problem with earliness and tardiness costs
• Single machine scheduling with symmetric earliness and tardiness penalties
• Minimizing total tardiness in a scheduling problem with a learning effect
• A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert
• Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert
• Single machine earliness/tardiness scheduling problem with additional penalties about due window
• One-machine sequencing to minimize total tardiness: a fourth theorem for Emmons
• A theoretical development for the total tardiness problem and its application in branch and bound algorithms
• scientific article; zbMATH DE number 4047428 (Why is no real title available?)
• scientific article; zbMATH DE number 151905 (Why is no real title available?)
• A bicriterion scheduling problem involving total flowtime and total tardiness
• Insights into two solution procedures for the single machine tardiness problem
• Algorithmic paradoxes of the single-machine total tardiness problem
• A note on a single machine scheduling problem with generalized total tardiness objective function

This page was built for publication: On the Single-machine Scheduling Problem with Tardiness Penalties

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