An SA/TS mixture algorithm for the scheduling tardiness problem

DOI10.1016/0377-2217(94)00213-4MaRDI QIDQ1266621zbMATH OpenOpenAlexFDO

Authors Belarmino Adenso-Díaz

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

zbMATH Keywords

heuristicsschedulingsimulated annealingtabu search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 6263695
• A very fast TS/SA algorithm for the job shop scheduling problem
• Scheduling in flowshops to minimize total tardiness of jobs
• A simulated annealing approach for the one-machine mean tardiness scheduling problem
• A tabu search approach to machine scheduling

Cites work

• A heuristic for the single machine tardiness problem
• A user's guide to tabu search
• An Evaluation of Flow Shop Sequencing Heuristics
• Applying tabu search to the job-shop scheduling problem
• Convergence of an annealing algorithm
• Equation of state calculations by fast computing machines
• Focused Scheduling in Proportionate Flowshops
• scientific article; zbMATH DE number 3485481 (Why is no real title available?)
• Optimization by simulated annealing
• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• Restricted neighborhood in the tabu search for the flowshop problem
• Single Machine Earliness-Tardiness Scheduling Problems Using the Equal–Slack Rule
• Some efficient heuristic methods for the flow shop sequencing problem
• Some experiments with simulated annealing for coloring graphs
• Tabu Search—Part I
• Tabu Search—Part II
• Weighted Tardiness Single Machine Scheduling with Proportional Weights

Cited in

(6)

• A composite heuristic for the single machine early/tardy job scheduling problem.
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
• Modelling and heuristics of FMS scheduling with multiple objectives
• Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times
• Two-agent proportionate flowshop scheduling with deadlines: polynomial-time optimization algorithms
• Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: An SA/TS mixture algorithm for the scheduling tardiness problem

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