Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net
From MaRDI portal
Publication:1760793
DOI10.1155/2012/651310zbMath1251.90114OpenAlexW2017957022WikidataQ58906342 ScholiaQ58906342MaRDI QIDQ1760793
Behnam Barzegar, Hossein Bozorgi, Homayun Motameni
Publication date: 15 November 2012
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/651310
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30)
Related Items
Supervisor reconfiguration for deadlock prevention by resources reallocation ⋮ Control of discrete event systems by means of discrete optimization and disjunctive colored PNs: application to manufacturing facilities ⋮ A research survey: review of flexible job shop scheduling techniques
Cites Work
- Unnamed Item
- A filter-and-fan approach to the job shop scheduling problem
- Job-shop scheduling with multi-purpose machines
- Effective job shop scheduling through active chain manipulation
- Job shop scheduling with beam search
- Deterministic job-shop scheduling: Past, present and future
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Effective neighbourhood functions for the flexible job shop problem
- Routing and scheduling in a flexible job shop by tabu search
- A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems
- A genetic algorithm for the flexible job-shop scheduling problem
- A hybrid genetic algorithm for the job shop scheduling problem
- A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
- The Complexity of Flowshop and Jobshop Scheduling
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A Fast Taboo Search Algorithm for the Job Shop Problem
- An effective hybrid optimization strategy for job-shop scheduling problems
