A new hybrid parallel genetic algorithm for the job‐shop scheduling problem

DOI10.1111/itor.12056zbMath1291.90101OpenAlexW2049333831MaRDI QIDQ4980005

Stavros T. Ponis, Elena Rokou, Ioannis T. Christou, Ilias P. Tatsiopoulos, Athanasios C. Spanos

Publication date: 20 June 2014

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12056

zbMATH Keywords

schedulingintelligent systemsgenetic algorithmspath relinkingjob-shop scheduling problem

Mathematics Subject Classification ID

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

Related Items (1)

Emergency scheduling of engineering rescue tasks in disaster relief operations and its application in China

Uses Software

• GALib
• JOBSHOP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An ant colony optimization algorithm for shop scheduling problems
• Solving job shop scheduling problems utilizing the properties of backbone and ``big valley
• Problem difficulty for tabu search in job-shop scheduling
• An algorithm for the job shop scheduling problem based on global equilibrium search techniques
• Ant colony optimization combined with taboo search for the job shop scheduling problem
• A search space analysis of the job shop scheduling problem
• A branch and bound algorithm for the job-shop scheduling problem
• Evolution based learning in a job shop scheduling environment
• Some new results on simulated annealing applied to the job shop scheduling problem
• A novel threshold accepting meta-heuristic for 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 computational study of shifting bottleneck procedures for shop scheduling problems
• Some aspects of scatter search in the flow-shop problem
• A hybrid evolutionary algorithm for the job shop scheduling problem
• 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
• A Computational Study of the Job-Shop Scheduling Problem
• A Survey of Scheduling Rules
• Computational Complexity of Discrete Optimization Problems
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• Discrete Programming by the Filter Method
• Algorithms for Solving Production-Scheduling Problems

This page was built for publication: A new hybrid parallel genetic algorithm for the job‐shop scheduling problem