Cyclic job shop robotic cell scheduling problem: Ant colony optimization
Authors:
- Atabak ElmiAEAtabak Elmi
- Seyda TopalogluSTSeyda Topaloglu
- 1 September 2017
- journal article
- research article
- Published by Elsevier in Computers & Industrial Engineering
- Vol. 111, 417-432
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single serverComputers & Operations Research, 2012
- A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing timesComputers & Operations Research, 2012
- A new approach to the cell formation problem with alternative processing routes and operation sequenceInternational Journal of Production Research, 2011
- Cyclic job shop scheduling problems with blockingAnnals of Operations Research, 2007
- A genetic approach to solving the problem of cyclic job shop scheduling with linear constraintsEuropean Journal of Operational Research, 2005
- A tabu search algorithm for scheduling a single robot in a job-shop environmentDiscrete Applied Mathematics, 2002
- Petri net modeling and scheduling for cyclic job shops with blockingComputers & Industrial Engineering, 1998
- A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robotsComputers & Operations Research, 1998
- Ant colony system: a cooperative learning approach to the traveling salesman problemIEEE Transactions on Evolutionary Computation, 1997
- Sequencing of parts and robot moves in a robotic cellInternational Journal of Flexible Manufacturing Systems, 1992