A New Approach for Solving the Flow Shop Scheduling Problem Through Neural Network Technique With Known Breakdown Time and Weights of Jobs

Harendra Kumar and Shailendra Giri
Additional contact information
Harendra Kumar: Gurukula Kangri Vishwavidyalaya, India
Shailendra Giri: Gurukula Kangri Vishwavidyalaya, India

International Journal of Service Science, Management, Engineering, and Technology (IJSSMET), 2021, vol. 12, issue 1, 77-96

Abstract: This paper considers a flow shop scheduling problems of n jobs on m machines involving processing times and weights of jobs with the major constraint as breakdown times of the machines. In this paper a new procedure is provided to obtain an optimal job sequence with the objective of minimize the makespan and mean weighted flow time by using neural network technique. To illustrate the proposed method procedure, a numerical example is given. The effectiveness of the proposed method is compared with many problems which are taken from different papers. This paper also provides a comparison of our proposed method with the existing methods in literature.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 8/IJSSMET.2021010105 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jssmet:v:12:y:2021:i:1:p:77-96

Access Statistics for this article

International Journal of Service Science, Management, Engineering, and Technology (IJSSMET) is currently edited by Ahmad Taher Azar

More articles in International Journal of Service Science, Management, Engineering, and Technology (IJSSMET) from IGI Global
Bibliographic data for series maintained by Journal Editor ().