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

DOI10.1016/J.ADVENGSOFT.2008.03.020MaRDI QIDQ2378080zbMATH OpenOpenAlexFDO

Authors 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

ant colony optimizationgenetic algorithmshybrid systemsparallel machinesstatistical analysis

Mathematics Subject Classification ID

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

Recommendations

• Scheduling job shop associated with multiple routings with genetic and ant colony heuristics
• Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints
• Solving flexible job shop scheduling problem by genetic algorithm
• Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic
• An improved genetic algorithm for the distributed and flexible job-shop scheduling problem

Cites work

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

Cited in

(9)

• Universal shop scheduling method for manufacturing system with evolution algorithm
• A neural network algorithm for servicing jobs with sequential and parallel machines
• Fast parallel heuristics for the job shop scheduling problem
• A job-shop scheduling approach for optimising sugarcane rail operations
• Scheduling job shop associated with multiple routings with genetic and ant colony heuristics
• Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem
• Méthode heuristique pour le problème de flow shop hybride avec machines dédiées
• Hybrid tabu search and a truncated branch-and-bound for the unrelated parallel machine scheduling problem
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination

This page was built for publication: A hybrid heuristic to solve the parallel machines job-shop scheduling problem

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