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

Standard

A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage. / Kononova, P. A.; Kochetov, Yu A.

In: Journal of Applied and Industrial Mathematics, Vol. 13, No. 2, 01.04.2019, p. 239-249.

Research output: Contribution to journal › Article › peer-review

BibTeX

@article{f15ed7c9dec54a30ba3a7d233ca362c9,

title = "A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage",

abstract = "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{\textquoteright} 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.",

keywords = "due date, scheduling, setup time, tabu search, tardiness",

author = "Kononova, {P. A.} and Kochetov, {Yu A.}",

year = "2019",

month = apr,

day = "1",

doi = "10.1134/S1990478919020054",

language = "English",

volume = "13",

pages = "239--249",

journal = "Journal of Applied and Industrial Mathematics",

issn = "1990-4789",

publisher = "Maik Nauka-Interperiodica Publishing",

number = "2",

}

RIS

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 -

ID: 20633981