Abstract:
This paper presents numerous heuristics, derived from the NEH heuristic, aimed at minimizing the classical permutation flowshop scheduling problem. We compare the solutio...Show MoreMetadata
Abstract:
This paper presents numerous heuristics, derived from the NEH heuristic, aimed at minimizing the classical permutation flowshop scheduling problem. We compare the solution, based on Taillard's benchmark problems. We propose a better schedule by comparing these heuristics and identifying common partial sequences of consecutive jobs. We identify the closest heuristic to our result by using a standard distance measure used in the literature. We use this heuristic as an initial solution for a further standard improvement procedure. The obtained average relative percentage deviation values of our procedure is within a reasonable computational effort and appears to improve the published results on these problem sets.
Published in: 2022 8th International Conference on Control, Decision and Information Technologies (CoDIT)
Date of Conference: 17-20 May 2022
Date Added to IEEE Xplore: 30 June 2022
ISBN Information:
ISSN Information:
Study on Two-phase Optimized Scheduling of Virtual Power Plant Based on Scheduling External Encapsulation Standard
Guihong Wu,Xin Jiang,Zhongyi Wan
An Intelligent Method for Multi Processor Scheduling Using Genetic Algorithms
Peyman Almasi Nejad,Ahmad Farahi,Davood Karim Zadegan Moghadam,Reza Asgary Moghadam
The Multi-Processor Scheduling Problem in Phylogenetics
Jiajie Zhang,Alexandros Stamatakis
Surrogate-Assisted Symbiotic Organisms Search Algorithm for Parallel Batch Processor Scheduling
ZhengCai Cao,ChengRan Lin,MengChu Zhou,JiaQi Zhang
On the single-processor scheduling problem with time restrictions
Rachid Benmansour,Oliver Braun,Abdelhakim Artiba
Effective operating system scheduling domain hierarchy for core-cache awareness
Jun Wei Lam,Ian Tan,Boon Leong Ong,Chang Kian Tan
On simulating processor schedules and network protocols within CPS using TrueTime
Sreram Balasubramaniyan,B. Subathra,R. C. Hemesh,Saravanakumar Gurusamy,Seshadri Srinivasan
Scheduling Jobs in a Two-Stage Hybrid Flow Shop with a Simulation-Based Genetic Algorithm and Standard Dispatching Rules
Benjamin Rolf,Tobias Reggelin,Abdulrahman Nahhas,Marcel Müller,Sebastian Lang
Modeling Real-Time Application Processor Scheduling for Fog Computing
Mani Sharifi,Abdolreza Abhari,Sharareh Taghipour