Ant colony optimisation with parameterised search space for the job shop scheduling problem

DOI10.1080/00207540802538021zbMath1197.90228OpenAlexW2074599664MaRDI QIDQ3163736

Daecheol Kim, Min-Seok Seo

Publication date: 26 October 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540802538021

zbMATH Keywords

makespanNP-hardjob-shop schedulingdisjunctive graphant colony optimisation

Mathematics Subject Classification ID

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

Related Items

An effective new island model genetic algorithm for job shop scheduling problem ⋮ A hybrid differential evolution and tree search algorithm for the job shop scheduling problem ⋮ A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Local search genetic algorithms for the job shop scheduling problem
• Problem difficulty for tabu search in job-shop scheduling
• Insertion techniques for the heuristic solution of the job shop problem
• Two simulated annealing-based heuristics for the job shop scheduling problem
• Ant colony optimization theory: a survey
• Multiple colony ant algorithm for job-shop scheduling problem
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
• Algorithms for Solving Production-Scheduling Problems