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...
Saved in:
| Published in: | Applied mathematics and computation Vol. 185; no. 1; pp. 218 - 228 |
|---|---|
| Main Authors: | , |
| 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!
|
Be the first to leave a comment!