z-logo
open-access-imgOpen Access
Flow Shop Scheduling Model for 5machine without Job Block Criteria Using NEH Technique
Author(s) -
E. Janaki,
A. Mohamed Ismail
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1377/1/012020
Subject(s) - flow shop scheduling , block scheduling , job shop scheduling , block (permutation group theory) , computer science , scheduling (production processes) , mathematical optimization , operations research , mathematics , schedule , operating system , mathematics education , geometry
The present paper describes no job block criteria using NEH technique in a Flow Shop Scheduling Model for five machines. In flow shop, constraints demand that the jobs passing the machine are same. The probabilities are associated with their respective processing times, in which the optimization criteria is the utilization of 5 machines. For a group of jobs in 5 machines, with no job block and No-wait time is considered in the paper. Our agenda is to reduce the total completion time and the shortest job sequence path using NEH algorithm. Sample numerical illustrations are provided to understand the NEH algorithm easily.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here