A hybrid heuristic to solve the parallel machines job-shop scheduling problem

DOI10.1016/j.advengsoft.2008.03.020zbMath1156.90370MaRDI QIDQ2378080

Yanyan Li

Publication date: 6 January 2009

Published in: Advances in Engineering Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.advengsoft.2008.03.020

zbMATH Keywords

hybrid systems; parallel machines; genetic algorithms; statistical analysis; ant colony optimization

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• An ant colony optimization algorithm for shop scheduling problems
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
• The job shop scheduling problem: Conventional and new solution techniques
• An alternative framework to Lagrangian relaxation approach for job shop scheduling.
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
• Deterministic job-shop scheduling: Past, present and future
• A hybrid metaheuristic for the resource-constrained project scheduling problem
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A SHIFTING BOTTLENECK APPROACH FOR A PARALLEL-MACHINE FLOWSHOP SCHEDULING PROBLEM
• Dynamic scheduling of FMS using a real-time genetic algorithm
• Reactive scheduling in a dynamic and stochastic FMS environment
• Algorithms for Solving Production-Scheduling Problems
• An effective hybrid optimization strategy for job-shop scheduling problems