A heuristic for the single machine tardiness problem

DOI10.1016/0377-2217(93)90241-EzbMath0782.90057MaRDI QIDQ1310015

Christos P. Koulamas, Milton L. Smith, Shrikant S. Panwalkar

Publication date: 28 February 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicdue datesmean tardinesssingle machine sequencing

Mathematics Subject Classification ID

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

Related Items (24)

Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints ⋮ A tabu search algorithm for the single machine total weighted tardiness problem ⋮ Scheduling on parallel identical machines to minimize total tardiness ⋮ A theoretical development for the total tardiness problem and its application in branch and bound algorithms ⋮ Scheduling parallel machines to minimize total weighted and unweighted tardiness ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness ⋮ Single machine group scheduling with family setups to minimize total tardiness ⋮ Minimizing total tardiness on a single machine with unequal release dates ⋮ Sequencing jobs on a single machine: A neural network approach ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert ⋮ Parallel machine scheduling considering a job-splitting property ⋮ Greedy solutions of selection and ordering problems ⋮ Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint ⋮ An SA/TS mixture algorithm for the scheduling tardiness problem ⋮ A neural network model for scheduling problems ⋮ Single-machine scheduling with time windows and earliness/tardiness penalties ⋮ A note on the equivalence of two heuristics to minimize total tardiness ⋮ Evaluation of leading heuristics for the single machine tardiness problem ⋮ Bottleneck-focused scheduling for a hybrid flowshop ⋮ The single-machine total tardiness scheduling problem: review and extensions ⋮ Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert ⋮ Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness

Cites Work

• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• A decomposition algorithm for the single machine total tardiness problem
• Scheduling with Deadlines and Loss Functions
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
• A dual algorithm for the one-machine scheduling problem
• Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
• An experimental comparison of solution algorithms for the single-machine tardiness problem
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
• Unnamed Item
• Unnamed Item

This page was built for publication: A heuristic for the single machine tardiness problem