Paper Info
Title
An Improved Genetic Algorithm With Local Search For Order Acceptance And Scheduling Problems
Abstract
The research on order acceptance and scheduling problems, which combine the selection with scheduling, is an important subject in production systems and has attracted attentions from both academia and practitioners. In this paper, we propose an improved genetic algorithm (GA) with local search, named IGAL, for the order acceptance and scheduling problems with tardiness penalties and sequence-dependent setup times in single machine environment. In order to improve the performance of the classical GA for the focused problems, two effective local search strategies are adopted in IGAL. The efficacy of IGAL was evaluated on 1500 instances with up to 100 orders. Experimental results showed that the proposed IGAL is quite competitive when compared with five other methods.
Year
DOI
Venue
2013
10.1109/CIPLS.2013.6595208
PROCEEDINGS OF THE 2013 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN PRODUCTION AND LOGISTICS SYSTEMS (CIPLS)
Keywords
Field
DocType
order acceptnce and scheduling, genetic algorithm, local search, sequence dependent setup times
Single-machine scheduling,Mathematical optimization,Tardiness,Fair-share scheduling,Scheduling (computing),Computer science,Rate-monotonic scheduling,Local search (optimization),Dynamic priority scheduling,Genetic algorithm
Conference
Volume
Issue
ISSN
null
null
null
Citations 
PageRank 
References 
0
0.34
15
Authors
4
Name
Order
Citations
PageRank
Chen Cheng100.34
Zhenyu Yang280.79
Lining Xing3168.51
Yuejin Tan401.01