FLOWSHOP SCHEDULING USING A NETWORK APPROACH
DOI:
https://doi.org/10.4314/njt.342.932Keywords:
Flow shop, network, linear programming, makespan, Gantt Chart, LINGOAbstract
In this paper, a network based formulation of a permutation flow shop problem is presented. Two nuances of flow shop problems with different levels of complexity are solved using different approaches to the linear programming formulation. Key flow shop parameters inclosing makespan of the flow shop problems were obtained without recourse to the traditional approach of using Gantt charts. The linear programming models of the flow shop problems considered were solved using LINGO 7.0. The present technique has been shown to be very effective and efficient.
Downloads
Issue
Section
License
The contents of the articles are the sole opinion of the author(s) and not of NIJOTECH.
NIJOTECH allows open access for distribution of the published articles in any media so long as whole (not part) of articles are distributed.
A copyright and statement of originality documents will need to be filled out clearly and signed prior to publication of an accepted article. The Copyright form can be downloaded from http://nijotech.com/downloads/COPYRIGHT%20FORM.pdf while the Statement of Originality is in http://nijotech.com/downloads/Statement%20of%20Originality.pdf
For articles that were developed from funded research, a clear acknowledgement of such support should be mentioned in the article with relevant references. Authors are expected to provide complete information on the sponsorship and intellectual property rights of the article together with all exceptions.
It is forbidden to publish the same research report in more than one journal.
How to Cite
