An SA/TS mixture algorithm for the scheduling tardiness problem
From MaRDI portal
Publication:1266621
DOI10.1016/0377-2217(94)00213-4zbMath0913.90155OpenAlexW2019889591MaRDI QIDQ1266621
Publication date: 29 November 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00213-4
Related Items (5)
Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times ⋮ Minimizing earliness and tardiness penalties in a single-machine problem with a common due date ⋮ A composite heuristic for the single machine early/tardy job scheduling problem. ⋮ Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics ⋮ Modelling and heuristics of FMS scheduling with multiple objectives
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Some experiments with simulated annealing for coloring graphs
- Some efficient heuristic methods for the flow shop sequencing problem
- Restricted neighborhood in the tabu search for the flowshop problem
- A heuristic for the single machine tardiness problem
- A user's guide to tabu search
- Applying tabu search to the job-shop scheduling problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Convergence of an annealing algorithm
- Focused Scheduling in Proportionate Flowshops
- Tabu Search—Part I
- Tabu Search—Part II
- An Evaluation of Flow Shop Sequencing Heuristics
- Weighted Tardiness Single Machine Scheduling with Proportional Weights
- Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
- Equation of State Calculations by Fast Computing Machines
This page was built for publication: An SA/TS mixture algorithm for the scheduling tardiness problem
