Abstract
In this paper we have developed an algorithm for n-jobs with m-machine flow shop scheduling problems in order to handle variety of data type than Geleta [3]. In other hands, as in Geleta [3] it main objective is how to obtain optimal sequence of jobs with aim of minimum squared value of lateness.
Highlights
We extended the work of change [1], Ikram [2] and Geleta
The algorithm seems the same with that of Geleta’s but it is shifted to other data type. Still it does not work for all types of data
With the completion time of job done on position place is given by
Summary
To cite this article: Geleta Tadele Mohammed. Special Case Algorithm for N-jobs M-machines Flow Shop Scheduling Problems. Received: February 10, 2016; Accepted: December 29, 2016; Published: April 7, 2017
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
