Performance enhancements to tabu search for the early/tardy scheduling problem

DOI10.1016/S0377-2217(97)00261-0MaRDI QIDQ1609889zbMATH OpenOpenAlexFDO

Authors Ross J. W. James, John Buchanan

Publication date 18 August 2002

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

Full work available at URL https://doi.org/10.1016/s0377-2217(97)00261-0

zbMATH Keywords

heuristicstabu searchearly/tardy scheduling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Search theory (90B40)

Recommendations

• Using tabu search to solve the common due date early/tardy machine scheduling problem
• A tabu search approach to machine scheduling
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• A tabu search approach for the single machine mean tardiness problem
• A tabu search algorithm for parallel machine total tardiness problem

Cites work

• scientific article; zbMATH DE number 4064338 (Why is no real title available?)
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• A new heuristic method for the flow shop sequencing problem
• An experimental comparison of solution algorithms for the single-machine tardiness problem
• Applying tabu search with influential diversification to multiprocessor scheduling
• Effective job shop scheduling through active chain manipulation
• Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
• Improving the Efficiency of Tabu Search for Machine Sequencing Problems
• Performance Guarantees for Scheduling Algorithms
• Restricted neighborhood in the tabu search for the flowshop problem
• Single-machine scheduling with early and tardy completion costs
• Some efficient heuristic methods for the flow shop sequencing problem
• The Single Machine Early/Tardy Problem

Cited in

(10)

• Counting and enumeration complexity with application to multicriteria scheduling
• A study on the enhanced best performance algorithm for the just-in-time scheduling problem
• An efficient genetic algorithm for job shop scheduling with tardiness objectives.
• Improved heuristics for the early/tardy scheduling problem with no idle time
• Multiple machine JIT scheduling: a tabu search approach
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• Fast neighborhood search for the single machine earliness-tardiness scheduling problem
• A tabu search approach to machine scheduling
• A tabu search algorithm for parallel machine total tardiness problem
• A recovering beam search algorithm for the single machine just-in-time scheduling problem

Describes a project that uses

Uses Software

• Tabu search

This page was built for publication: Performance enhancements to tabu search for the early/tardy scheduling problem

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