Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling

In this paper, we consider a flow shop scheduling problem under different conditions. The model is formulated in a form of mixed binary integer programming. The primary goal of this paper is to develop operation schedules that specify the completion time of operations. The objective function of our...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematics and computation Vol. 185; no. 1; pp. 218 - 228
Main Authors: Ziaee, Mohsen, Sadjadi, S.J.
Format: Journal Article
Language:English
Published: New York, NY Elsevier Inc 01.02.2007
Elsevier
Subjects:
ISSN:0096-3003, 1873-5649
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we consider a flow shop scheduling problem under different conditions. The model is formulated in a form of mixed binary integer programming. The primary goal of this paper is to develop operation schedules that specify the completion time of operations. The objective function of our model is formulated as a minimization of the makespan, the weighted mean flow-time or the weighted mean tardiness. There are several constraints which are involved in our modeling such as the due dates of jobs, the jobs ready times, etc. For these objective functions and constraints, seven mixed binary integer programming models are proposed. We demonstrate the implementation of our proposed models using different numerical examples. As a case study, we apply the proposed models for an information systems development (ISD) center to schedule the ISD projects using some real data.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2006.06.092