TY - DATA
T1 - Source code for the article: Time/sequence-dependent scheduling: the design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm
PY - 2019/12/28
AU - Lei He
AU - Mathijs de Weerdt
AU - Neil Yorke-Smith
UR - https://data.4tu.nl/articles/dataset/Source_code_for_the_article_Time_sequence-dependent_scheduling_the_design_and_evaluation_of_a_general_purpose_tabu-based_adaptive_large_neighbourhood_search_algorithm/12689276/1
DO - 10.4121/uuid:3a23b216-3762-4a61-ba2c-d3df6dc53268
KW - Adaptive large neighbourhood search
KW - Factor analysis
KW - Hybrid algorithms
KW - Tabu search
KW - Time windows
KW - Time/sequence-dependent scheduling
N2 - In intelligent manufacturing, it is important to schedule orders from customers efficiently. Make-to-order companies may have to reject or postpone orders when the production capacity does not meet the demand. Many such real-world scheduling problems are characterised by processing times being dependent on the start time (time dependency) or on the preceding orders (sequence dependency), and typically have an earliest and latest possible start time. We introduce and analyze four algorithmic ideas for this class of time/sequence-dependent over-subscribed scheduling problems with time windows: a novel hybridization of adaptive large neighbourhood search (ALNS) and tabu search (TS), a new randomization strategy for neighbourhood operators, a partial sequence dominance heuristic, and a fast insertion strategy. 
This dataset contains the source code of our hybrid algorithm: ALNS/TPF. If you use this  code, please cite the following paper: He L , De Weerdt M , Yorke-Smith N. Time/sequence-dependent scheduling: the design and evaluation of a general purpose tabu-based adaptive large neighbourhood search algorithm[J]. Journal of Intelligent Manufacturing, 2019, DOI: 10.1007/s10845-019-01518-4.
ER -