Mathematical formulations for scheduling in manufacturing cells with limited capacity buffers Online publication date: Fri, 02-Apr-2010
by Sherif A. Fahmy, Tarek Y. ElMekkawy, Subramaniam Balakrishnan
International Journal of Operational Research (IJOR), Vol. 7, No. 4, 2010
Abstract: In the past decade, the deadlock-free scheduling problem in flexible manufacturing systems has received much attention from researchers and practitioners. This is due to the growing trend of automation, and the rising need for flexible manufacturing systems that can cope with the everyday changing market demand. In this article, mixed-integer programming formulations for the deadlock-free scheduling problem of flexible manufacturing cells are proposed. A job shop environment is assumed where each job may have a different processing route. The proposed models consider the presence of different types of buffers in the system. Furthermore, to enhance the comprehensiveness of the models, a heuristic to insert transportation operations into the obtained schedules is proposed. Finally, computational experiments are conducted to investigate the performance of the proposed models in terms of efficiency and computational time.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Operational Research (IJOR):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook