Open AccessComputational Experiments on Workflow Balancing of Parallel Machine Scheduling with Precedence Constraints and Sequence Independent Setup Time
Publication year - 2020
Publication title -
journal of science and technolgy
Language(s) - English
Resource type - Journals
ISSN - 2456-5660
DOI - 10.46243/jst.2020.v5.i5.pp154-161
Subject(s) - heuristics , computer science , workflow , scheduling (production processes) , schedule , sequence (biology) , job shop scheduling , execution time , parallel computing , mathematical optimization , algorithm , mathematics , database , biology , genetics , operating system
The workflow balancing of parallel machines scheduling (PMS) with precedence constraints andsequence independent setup time is considered for study. The setup time consideration produces alternate schedulealong with lesser relative percentage of imbalance (RPI) value for PMS problem is demonstrated with an example.The lesser RPI indicates better workflow balancing among machines. The computational experiments are conductedon large instances of randomly generated PMS problems with precedent constraints and setup time. The variouscombinations of heuristics are used to solve the problems. The results show that genetic algorithm (GA) performswell against the other heuristics with lesser RPI values