Scheduling methodologies for a flexible manufacturing cell with non-identical parallel machines and a robot
by Majid M. Aldaihani
International Journal of Industrial and Systems Engineering (IJISE), Vol. 21, No. 4, 2015

Abstract: This paper presents exact and heuristic methodologies for scheduling a flexible manufacturing cell (FMC) that consists of a number of non-identical parallel machines, a robot for loading and unloading, and a pallet handling system, which moves a batch of mixed parts into and out of the system. In the exact methodology, a nonlinear programming model is introduced to mathematically describe the problem and to determine optimal solutions for small size FMC problems. In the heuristic methodology, a customised tabu search (TS) utilising a greedy insertion algorithm (GI) is developed to identify efficient solutions with reasonable amount of computational time for large size FMC problems. The objective of this study is to minimise the total completion time, which includes robot loading, unloading and machining times of a batch of jobs delivered into an FMC system by a pallet. Randomly generated test problems are used to evaluate the performance of the proposed algorithms. The computational experiments show that the hybrid of the tabu search and greedy insertion algorithm (TSGI) can produce efficient solutions with reasonable amount of computational time.

Online publication date: Wed, 28-Oct-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com