Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots

DOI10.5402/2011/165620MaRDI QIDQ420153zbMATH OpenOpenAlexWikidataFDO

Authors Fatima El Khoukhi, Tarik Lamoudan, Jaouad Boukachour, Ahmed El Hilali Alaoui

Publication date 21 May 2012

Published in ISRN Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.5402/2011/165620

Mathematics Subject Classification ID

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

Recommendations

• A simulated multi-objective model for flexible job shop transportation scheduling
• Multiple-Colony Ant Algorithm with Forward–Backward Scheduling Approach for Job-Shop Scheduling Problem
• Scheduling job shop associated with multiple routings with genetic and ant colony heuristics
• Adaptive ant colony algorithm and its application to multi-restriction multi-objective flexible Job-Shop scheduling
• Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm

Cites work

• A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints
• A new neighborhood and tabu search for the blocking job shop
• A note on the complexity of flow shop scheduling with transportation constraints
• 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
• An MILP for scheduling problems in an FMS with one vehicle
• Ant colony optimization combined with taboo search for the job shop scheduling problem
• Complexity of flow shop scheduling problems with transportation constraints
• Deterministic job-shop scheduling: Past, present and future
• Dynamic job shop scheduling using variable neighbourhood search
• Integrated production and material handling scheduling using mathematical programming and constraint programming
• Job-shop scheduling with limited capacity buffers
• Lagrangian bounds for just-in-time job-shop scheduling
• Machine scheduling with transportation considerations
• Mixed binary integer programming formulations for the reentrant job shop scheduling problem
• 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
• Tabu search algorithms for job-shop problems with a single transport robot

This page was built for publication: Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q420153)