Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots
From MaRDI portal
Publication:420153
DOI10.5402/2011/165620zbMath1238.90138WikidataQ58689013 ScholiaQ58689013MaRDI QIDQ420153
Ahmed El Hilali Alaoui, Jaouad Boukachour, Tarik Lamoudan, Fatima El Khoukhi
Publication date: 21 May 2012
Published in: ISRN Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5402/2011/165620
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Cites Work
- Tabu search algorithms for job-shop problems with a single transport robot
- Job-shop scheduling with limited capacity buffers
- A note on the complexity of flow shop scheduling with transportation constraints
- Ant colony optimization combined with taboo search for the job shop scheduling problem
- A new neighborhood and tabu search for the blocking job shop
- An MILP for scheduling problems in an FMS with one vehicle
- A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem
- A tabu search algorithm for scheduling a single robot in a job-shop environment
- Deterministic job-shop scheduling: Past, present and future
- Complexity of flow shop scheduling problems with transportation constraints
- A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints
- Integrated production and material handling scheduling using mathematical programming and constraint programming
- Lagrangian bounds for just-in-time job-shop scheduling
- Mixed binary integer programming formulations for the reentrant job shop scheduling problem
- Dynamic job shop scheduling using variable neighbourhood search
- Simultaneous job input sequencing and vehicle dispatching in a single-vehicle automated guided vehicle system: a heuristic branch-and-bound approach coupled with a discrete events simulation model
- Machine scheduling with transportation considerations
