What is it about?
A solution to the problem of job scheduling in a flow shop system is proposed in this paper. A three-machine flow shop system is presented with 10 sets of 10 random jobs to be processed. A new approach, called Simulated Hardening (SH), is used to schedule the jobs by taking into consideration two criteria: minimal makespan and maximal profit.
Featured Image
Why is it important?
The results obtained are compared with First In First Out (FIFO), Earliest Due Date (EDD), Shortest Processing Time (SPT), Longest Processing Time (LPT), Time Reserve (TR), and Descending Delay Penalty (DDP) sorting methods and confronted with the results of exhaustive search. The usefulness of the new SH algorithm is estimated in terms of the quality of the results obtained.
Perspectives
The results obtained are compared with First In First Out (FIFO), Earliest Due Date (EDD), Shortest Processing Time (SPT), Longest Processing Time (LPT), Time Reserve (TR), and Descending Delay Penalty (DDP) sorting methods and confronted with the results of exhaustive search. The usefulness of the new SH algorithm is estimated in terms of the quality of the results obtained.
Dr Andrzej Jardzioch
West Pomeranian University of Technolgy Szczecin
Read the Original
This page is a summary of: Job Scheduling Problem in a Flow Shop System with Simulated Hardening Algorithm, October 2017, Springer Science + Business Media,
DOI: 10.1007/978-3-319-68619-6_10.
You can read the full text:
Resources
Contributors
The following have contributed to this page