TY - JOUR

T1 - A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage

AU - Kononova, P. A.

AU - Kochetov, Yu A.

PY - 2019/4/1

Y1 - 2019/4/1

N2 - We present a new mathematical model for a single machine scheduling problem originated from the tile industry. The model takes into account the sequence-dependent setup times, the minimal batch size, heterogeneous orders of customers, and a stock in storage. As the objective function we use the penalty for tardiness of the customers’ orders and the total storage cost for final products. A mixed-integer linear programming model is applied for small test instances. For real-world applications, we design a randomized tabu search algorithm. The computational results for some test instances from a Novorossiysk company are discussed.

AB - We present a new mathematical model for a single machine scheduling problem originated from the tile industry. The model takes into account the sequence-dependent setup times, the minimal batch size, heterogeneous orders of customers, and a stock in storage. As the objective function we use the penalty for tardiness of the customers’ orders and the total storage cost for final products. A mixed-integer linear programming model is applied for small test instances. For real-world applications, we design a randomized tabu search algorithm. The computational results for some test instances from a Novorossiysk company are discussed.

KW - due date

KW - scheduling

KW - setup time

KW - tabu search

KW - tardiness

UR - http://www.scopus.com/inward/record.url?scp=85067419434&partnerID=8YFLogxK

U2 - 10.1134/S1990478919020054

DO - 10.1134/S1990478919020054

M3 - Article

AN - SCOPUS:85067419434

VL - 13

SP - 239

EP - 249

JO - Journal of Applied and Industrial Mathematics

JF - Journal of Applied and Industrial Mathematics

SN - 1990-4789

IS - 2

ER -