A bi-level decomposition algorithm for multi-factory scheduling with batch delivery problem

Published: 18-05-2020| Version 1 | DOI: 10.17632/3yw92trsy5.1
Contributor:
Fateme Marandi

Description

we present “Test problem of loose duedate” and “Test problem of tight duedate” folders to clarify the data used to generate test instances for comparison of BLDAs algorithms. Data sets are provided in excel format in two folders of zip format. The parameters of each problem, i.e. case I, case II, case III, case IV and case V are named separately in different excel files as below. This parameters are described in section 3, including Capacity of batch, Delivery cost, Demand quantity, Duedate, Holding cost, Processing times, Routes indicators, Tardy cost, Transportation cost, Volume of each unit of job

Files