Flowshop scheduling of robotic cells with job-dependent transportation and set-up effects

Flowshop scheduling of robotic cells with job-dependent transportation and set-up effects

0.00 Avg rating0 Votes
Article ID: iaor19962011
Country: United Kingdom
Volume: 46
Issue: 12
Start Page Number: 1447
End Page Number: 1455
Publication Date: Dec 1995
Journal: Journal of the Operational Research Society
Authors: , ,
Keywords: programming: travelling salesman
Abstract:

A flexible manufacturing cell consisting of two machining centres, several automated storage/retrieval stations, and a mobile transporting robot is considered. The problem is to schedule jobs on machines so as to minimize the makespan, with the effects of transportation and set-ups to be taken into account. The problem is studied with the aid of a graph model, and an exact algorithm of cubic complexity is derived based on the Gilmore-Gomory algorithm for the travelling salesman problem.

Reviews

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