Performance enhancements to tabu search for the early/tardy scheduling problem
DOI10.1016/S0377-2217(97)00261-0zbMATH Open0991.90056OpenAlexW2031479595MaRDI QIDQ1609889FDOQ1609889
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
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Search theory (90B40)
Cites Work
- Improving the Efficiency of Tabu Search for Machine Sequencing Problems
- Some efficient heuristic methods for the flow shop sequencing problem
- Single-machine scheduling with early and tardy completion costs
- The Single Machine Early/Tardy Problem
- Heuristics for Flowshop Scheduling Problems Minimizing Mean Tardiness
- A new heuristic method for the flow shop sequencing problem
- Applying tabu search with influential diversification to multiprocessor scheduling
- Performance Guarantees for Scheduling Algorithms
- An experimental comparison of solution algorithms for the single-machine tardiness problem
- A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
- Restricted neighborhood in the tabu search for the flowshop problem
- Effective job shop scheduling through active chain manipulation
- Title not available (Why is that?)
Cited In (10)
- 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.
- Multiple machine JIT scheduling: a tabu search approach
- Improved heuristics for the early/tardy scheduling problem with no idle time
- 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
- Counting and enumeration complexity with application to multicriteria scheduling
Uses Software
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)
