%0 Generic
%A He, Lei
%A Guijt, A. (Arthur)
%A de Weerdt, Mathijs
%A Xing, L. (Lining)
%A Yorke-Smith, Neil
%D 2019
%T Supplementary data for the article: Order Acceptance and Scheduling with Sequence-dependent Setup Times: a New Memetic Algorithm and Benchmark of the State of the Art
%U https://data.4tu.nl/articles/dataset/Supplementary_data_for_the_article_Order_Acceptance_and_Scheduling_with_Sequence-dependent_Setup_Times_a_New_Memetic_Algorithm_and_Benchmark_of_the_State_of_the_Art/12714527/1
%R 10.4121/uuid:c3623076-a1ac-4103-ad31-3068a28312f9
%K Adaptive large neighbourhood search
%K Biased random key genetic algorithm
%K Hybrid steady-state genetic algorithm
%K Iterated local search
%K Memetic algorithm
%K Order Acceptance and Scheduling
%X The Order Acceptance and Scheduling (OAS) consists of simultaneously selecting a subset of orders to be processed as well as determining the associated schedule. A common generalization includes sequence-dependent setup times and time windows. We propose a novel memetic algorithm for this problem, called Sparrow. The dataset contains the source code of Sparrow, as well as our implementation of two state-of-the-art algorithms for the OAS problem from the literature. It also contains some new benchmark instances with more realistic properties.
"If you use this data and/or code, please cite the following paper: He L , Guijt A , De Weerdt M , et al. Order Acceptance and Scheduling with Sequence-dependent Setup Times: a New Memetic Algorithm and Benchmark of the State of the Art[J]. Computers & Industrial Engineering, 2019, 138."
%I 4TU.Centre for Research Data