SCHEDULING OF PERMUTATION FLOW SHOPS USING A NEW HYBRID ALGORITHM
| Main Author: | Brahma Datta Shukla * & Pragya Singh Tomar |
|---|---|
| Format: | Article Journal |
| Terbitan: |
, 2018
|
| Subjects: | |
| Online Access: |
https://zenodo.org/record/5150017 |
Daftar Isi:
- In the current situation, modern engineering and industrial built-up units are encountering a jumble of issues in a variety of areas, including machining time, electricity, manpower, raw materials, and client restraints. One of the most important industrial behaviors, particularly in manufacturing planning, is job-shop scheduling. This study provides a new updated suggested approach of johnson's algorithm as well as the gupta's heuristic algorithm to solve the permutation flow shop sequencing problem with the goal of making the makespan as little as possible. This work is about determining the processing order of n tasks in m machines. Although, because the problem is np-hard for three or more computers, this results in a near-optimal solution to the given issue. The suggested approach is straightforward and easy to comprehend, and it is accompanied with a numerical example.