An Algorithm towards minimizing Make-span of Scheduling 'n' Jobs on 'm' Machines
Main Article Content
Abstract
One of the common issues in production scheduling is the flow shop sequencing issue. A specific type of manufacturing process follows a predetermined linear structure in a flow shop. To solve a flow shop problem in a static workshop, the goal of this study is to determine the shortest possible total processing time (make-span) for a sequence of 'n' tasks on 'm' machines. The suggested method is based on how each work slopes as it moves from the first to the last machine. This method is contrasted with four popular heuristics (Palmer, CDS, Dannenbring, NEH). The findings of the study for 'n' x 'm' flow shop sequencing problems show that the proposed method is effective and shows a promising amount of progress when compared to the other four heuristic strategies.
Article Details
Issue
Section
Articles
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms: a. Authors retain copyright and grant the journal right of first publication, with the work two years after publication simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal. b. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal. c. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).