A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots

A polynomial algorithm for scheduling small-scale manufacturing cells served by multiple robots

0.00 Avg rating0 Votes
Article ID: iaor1999105
Country: United Kingdom
Volume: 25
Issue: 1
Start Page Number: 53
End Page Number: 62
Publication Date: Jan 1998
Journal: Computers and Operations Research
Authors: ,
Keywords: graphs
Abstract:

The n-job, two-machine, multi-robot flowshop scheduling problem is considered with the objective of minimizing makespan. Various transportation, setup and loading/unloading effects arising in a modern flexible manufacturing cell are modeled by a graph representation of the technological process. An algorithm of O(n2) complexity is derived to solve the problem to optimality.

Reviews

Required fields are marked *. Your email address will not be published.