A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
From MaRDI portal
Publication:3993674
DOI10.1057/jors.1992.6zbMath0762.90038OpenAlexW2081034799MaRDI QIDQ3993674
J. Edward Holsenback, Randolph M. Russell
Publication date: 13 August 1992
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1992.6
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints ⋮ A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems ⋮ Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness ⋮ 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 ⋮ Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates ⋮ A simulated annealing approach for the one-machine mean tardiness scheduling problem ⋮ A note on the equivalence of two heuristics to minimize total tardiness ⋮ Evaluation of leading heuristics for the single machine tardiness problem ⋮ 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 ⋮ A heuristic for the single machine tardiness problem
