cff-version: 1.2.0
abstract: "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.""
authors:
  - family-names: He
    given-names: Lei
    orcid: "https://orcid.org/0000-0002-2787-5064"
  - family-names: Guijt
    given-names: A. (Arthur)
  - family-names: de Weerdt
    given-names: Mathijs
    orcid: "https://orcid.org/0000-0002-0470-6241"
  - family-names: Xing
    given-names: L. (Lining)
    orcid: "https://orcid.org/0000-0002-6983-4244"
  - family-names: Yorke-Smith
    given-names: Neil
    orcid: "https://orcid.org/0000-0002-1814-3515"
title: "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"
keywords:
version: 1
identifiers:
  - type: doi
    value: 10.4121/uuid:c3623076-a1ac-4103-ad31-3068a28312f9
license: CC BY-NC 4.0
date-released: 2019-10-31