A novel threshold accepting meta-heuristic for the job-shop scheduling problem

DOI10.1016/S0305-0548(03)00172-2zbMATH Open1071.68016OpenAlexW2044475081MaRDI QIDQ1885997FDOQ1885997

Authors: Dae Sung Lee, Vassilios S. Vassiliadis, Jong Moon Park 

Publication date: 12 November 2004

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00172-2

Recommendations

• A very fast TS/SA algorithm for the job shop scheduling problem
• A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
• scientific article; zbMATH DE number 1054937
• A Novel Heuristic Approach for Job Shop Scheduling Problem
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem

zbMATH Keywords

SchedulingMeta-heuristicsThreshold acceptingJob-shopLBTA algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• A Computational Study of the Job-Shop Scheduling Problem
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
• NP-complete scheduling problems
• The job shop scheduling problem: Conventional and new solution techniques
• Deterministic job-shop scheduling: Past, present and future
• Job Shop Scheduling by Local Search
• A genetic algorithm for the job shop problem
• Some new results on simulated annealing applied to the job shop scheduling problem
• Evolution based learning in a job shop scheduling environment
• A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems
• A Computational Study of Local Search Algorithms for Job Shop Scheduling
• Insertion techniques for the heuristic solution of the job shop problem

Cited In (7)

• Multi-agent list-based threshold-accepting algorithm for numerical optimisation
• Threshold accepting heuristic for fair flow optimization in wireless mesh networks
• Optimization of manufacturing processes by distributed simulation
• A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
• A fuzzy based threshold policy for a single server retrial queue with vacations
• Multiple colony ant algorithm for job-shop scheduling problem
• A new hybrid parallel genetic algorithm for the job-shop scheduling problem

Uses Software

• JOBSHOP

This page was built for publication: A novel threshold accepting meta-heuristic for the job-shop scheduling problem

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