A hybrid evolutionary algorithm to solve the job shop scheduling problem

DOI10.1007/s10479-013-1332-5zbMath1350.90018OpenAlexW2000721451MaRDI QIDQ324301

Bo Peng, Zhipeng Lü, Cheng, T. C. Edwin

Publication date: 11 October 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-013-1332-5

zbMATH Keywords

job shop schedulingevolutionary algorithmpopulation updatingrecombination operator

Mathematics Subject Classification ID

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

Related Items (5)

A survey of job shop scheduling problem: the types and models ⋮ Evolutionary algorithms for supply chain management ⋮ An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks ⋮ Novel model and solution method for flexible job shop scheduling problem with batch processing machines ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A time-indexed LP-based approach for min-sum job-shop problems
• Solving an integrated job-shop problem with human resource constraints
• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
• A genetic algorithm for the job shop problem
• Job-shop scheduling: Computational study of local search and large-step optimization methods
• A new hybrid genetic algorithm for job shop scheduling problem
• Some new results on simulated annealing applied to the job shop scheduling problem
• A very fast TS/SA algorithm for the job shop scheduling problem
• An advanced tabu search algorithm for the job shop problem
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• A genetic algorithm for the flexible job-shop scheduling problem
• Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• Job Shop Scheduling by Simulated Annealing
• New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling
• The Complexity of Flowshop and Jobshop Scheduling
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem

This page was built for publication: A hybrid evolutionary algorithm to solve the job shop scheduling problem