Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm
DOI10.1016/J.INS.2011.11.013zbMATH Open1247.90166OpenAlexW1992042581MaRDI QIDQ454950FDOQ454950
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
Recommendations
- scientific article; zbMATH DE number 1174531
- Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
- An improved genetic algorithm for solving the mixed-flow job-shop scheduling problem with combined processing constraints
- Job shop scheduling with a genetic algorithm and machine learning
- Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm
- A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking
- Large-Scale Scientific Computing
- Genetic algorithm with constraint model for sequencing workingsteps on machining center
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Problem difficulty for tabu search in job-shop scheduling
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- A Survey of Scheduling Rules
- A survey of priority rule-based scheduling
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- An alternative framework to Lagrangian relaxation approach for job shop scheduling.
- Deterministic job-shop scheduling: Past, present and future
- A genetic algorithm for the flexible job-shop scheduling problem
- A genetic algorithm for the job shop problem
- A very fast TS/SA algorithm for the job shop scheduling problem
- An advanced tabu search algorithm for the job shop problem
- A systematic procedure for setting parameters in simulated annealing algorithms
- Modified bottleneck-based heuristic for large-scale job-shop scheduling problems with a single bottleneck
Cited In (4)
- Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
- Credit risk prediction using fuzzy immune learning
- A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues
- An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
This page was built for publication: Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454950)
