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
datasetposted on 31.10.2019 by Lei He, A. (Arthur) Guijt, M.M. (Mathijs) de Weerdt, L. (Lining) Xing, Neil Yorke-Smith
Datasets usually provide raw data for analysis. This raw data often comes in spreadsheet form, but can be any collection of data, on which analysis can be performed.
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."
China Hunan Provincial Innovation Foundation for Postgraduate, CX2018B020
China Scholarship Council, 201703170269