Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm

DOI10.1016/j.ins.2011.11.013zbMath1247.90166MaRDI QIDQ454950

Cheng Wu, Rui Zhang

Publication date: 2 October 2012

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2011.11.013

zbMATH Keywords

simulated annealing; genetic algorithm; job shop scheduling problem; bottleneck machine

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

Related Items

An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation, A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues, Credit risk prediction using fuzzy immune learning, Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects

Cites Work

• Unnamed Item
• Problem difficulty for tabu search in job-shop scheduling
• Ant colony optimization combined with taboo search for the job shop scheduling problem
• A survey of priority rule-based scheduling
• A genetic algorithm for the job shop problem
• A systematic procedure for setting parameters in simulated annealing algorithms
• An alternative framework to Lagrangian relaxation approach for job shop scheduling.
• Deterministic job-shop scheduling: Past, present and future
• A very fast TS/SA algorithm for the job shop scheduling problem
• An advanced tabu search algorithm for the job shop problem
• A genetic algorithm for the flexible job-shop scheduling problem
• Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck
• The Shifting Bottleneck Procedure for Job Shop Scheduling
• A Survey of Scheduling Rules