.png){kind=icon}
Return
Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm
.png){kind=icon}
PRE
AI
DOI：10.1080/00207540600619700.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Many dominance relations have been established in the literature for scheduling problems where they are mainly used in implicit enumeration techniques to further reduce the search space for finding an optimal solution. In this paper, we propose a novel method for discovering dominance relations for scheduling problems. We discover dominance relations by using an evolutionary algorithm. The proposed method of empirically discovering dominance relations can be used for any scheduling problem. After the description of the method, we apply it to a specific scheduling problem. The specific problem is the multimedia data objects scheduling problem for WWW applications which can be modelled as the two-machine flowshop problem of minimizing maximum lateness with separate setup times. The performances of the dominance relations obtained by the proposed method as well as the existing four dominance relations in literature are analysed. The results of the computational experiments show that the proposed method is quite efficient.
Keywords:
scheduling
multimedia
World Wide Web
flowshop
maximum lateness
dominance relations
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W
Organization
No organization information available
Cited Papers
ShareSave
ShareSaveShareSave
ShareSaveAnimal Experimental Study to Test Application of Intelligent Pressure Control Device in Monitoring and Control of Renal Pelvic Pressure During Flexible Ureteroscopy.png)
Urology
UrologyIF0
PREAI
ShareSaveOptimizing cutting parameters in process planning of prismatic parts by using genetic algorithms
PREAI
ShareSave
View more