IIUM Repository (IREP)

Formulation of an IP-based model for reactive flow-shop scheduling problem subject to arrival of new orders

Abdesselam, M. and Karim, A. N. M. and Kays, H. M. E. and Rahman, M. A. and Sarker, R.A. (2015) Formulation of an IP-based model for reactive flow-shop scheduling problem subject to arrival of new orders. Advanced Materials Research, 1115. pp. 616-621. ISSN 1022-6680

[img] PDF (IP-based model for reactive flow-shop) - Published Version
Restricted to Repository staff only

Download (404kB) | Request a copy

Abstract

In order to survive in a competitive environment, industries are required to adopt strategies that ensure their abilities to provide their customers with a product featured by good quality, low cost and short delivery time. Short term scheduling plays a pivotal role in this context by ensuring the operations to be executed and monitored in an optimal or sub-optimal manner which guarantees the product shipping within the customers’ due dates at lower cost and/or higher utilization of resources. However, the dynamic nature of the shop floor environment causes the predictive schedules to be no longer optimal or even feasible. Frequent disruptions occurring during the execution of the predictive schedule require the operations managers to be reactive to make appropriate decision considering the new situation. Adequate research works based on integer programming are available in literature to cope with static scheduling problems, but there is a dearth in integer programming based approaches for dynamic or reactive situations. The aim of this work is to formulate a model that solves the reactive flow-shop scheduling problem subject to arrival of new orders. Objective function for makespan minimization and the comprehensive equations for predictive and reactive schedules are presented with the necessary elaboration.

Item Type: Article (Journal)
Additional Information: 4289/48679
Uncontrolled Keywords: Mathematical modeling. Integer Programming. Reactive scheduling problem. Flow shop scheduling problem. Makespan minimization. Dynamic scheduling. New orders arrival.
Subjects: T Technology > TS Manufactures > TS155 Production management
Kulliyyahs/Centres/Divisions/Institutes: Kulliyyah of Engineering > Department of Manufacturing and Materials Engineering
Depositing User: Prof. Dr. A. N. Mustafizul Karim
Date Deposited: 20 Jan 2016 08:41
Last Modified: 18 Jul 2016 15:09
URI: http://irep.iium.edu.my/id/eprint/48679

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year