A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
From MaRDI portal
Publication:5638123
DOI10.1002/nav.3800180304zbMath0229.90029MaRDI QIDQ5638123
No author found.
Publication date: 1971
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800180304
90C10: Integer programming
Related Items
A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem, Real-time scheduling of an automated manufacturing center, An efficient job scheduling algorithm for mixed turnaround and deadline applications, Hybrid algorithm for sequencing with bicriteria, One machine scheduling to minimize expected mean tardiness. I, Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem, Four solution techniques for a general one machine scheduling problem. A comparative study, A survey of algorithms for the single machine total weighted tardiness scheduling problem, A heuristic for the single machine tardiness problem, The job shop tardiness problem: A decomposition approach, A greedy heuristic for the mean tardiness sequencing problem, One machine scheduling to minimize expected mean tardiness. II, Incorporating preference information into multi-objective scheduling, Genetic search with dynamic operating disciplines, Decomposition of the single machine total tardiness problem, Solution of the single machine total tardiness problem, A decomposition algorithm for the single machine total tardiness problem, Single machine scheduling with nonlinear cost functions, Minimizing total tardiness in a scheduling problem with a learning effect, Production problems with deadline penalties, A dual algorithm for the one-machine scheduling problem
Cites Work
