A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem

DOI10.1016/S0377-2217(96)00239-1zbMath0951.90553OpenAlexW2088028683MaRDI QIDQ1290704

John T. Buchanan, Ross J. W. James

Publication date: 17 December 2000

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00239-1

zbMATH Keywords

heuristicsschedulingtabu searchearly/tardy

Mathematics Subject Classification ID

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

Related Items (15)

Machine scheduling with earliness, tardiness and non-execution penalties ⋮ Fast neighborhood search for the single machine earliness-tardiness scheduling problem ⋮ Using tabu search to solve the common due date early/tardy machine scheduling problem ⋮ An improved earliness--tardiness timing algorithm ⋮ Efficient algorithms for machine scheduling problems with earliness and tardiness penalties ⋮ A recovering beam search algorithm for the single machine just-in-time scheduling problem ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert ⋮ Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem ⋮ Earliness-tardiness scheduling with setup considerations ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Punctuality and idleness in just-in-time scheduling ⋮ Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert ⋮ A heuristic for single machine scheduling with early and tardy costs ⋮ Performance enhancements to tabu search for the early/tardy scheduling problem ⋮ Minimizing earliness and tardiness costs in stochastic scheduling

Uses Software

• Tabu search

Cites Work

• Optimization by Simulated Annealing
• Future paths for integer programming and links to artificial intelligence
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• A user's guide to tabu search
• Sequencing with Earliness and Tardiness Penalties: A Review
• Determination of an optimal common due date and optimal sequence in a single machine job shop
• The Single Machine Early/Tardy Problem
• Tabu Search—Part I
• Tabu Search—Part II
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• Performance Guarantees for Scheduling Algorithms
• An experimental comparison of solution algorithms for the single-machine tardiness problem
• Single-machine scheduling with early and tardy completion costs
• Improving the Efficiency of Tabu Search for Machine Sequencing Problems

This page was built for publication: A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem