|
This article is cited in 3 scientific papers (total in 3 papers)
A local search algorithm for the single machine scheduling problem with setups and a storage
P. A. Kononovaab, Yu. A. Kochetovab a Sobolev Institute of Mathematics, 4 Acad. Koptyug Avenue, 630090 Novosibirsk, Russia
b Novosibirsk State University, 1 Pirogov Street, 630090 Novosibirsk, Russia
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' 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. Tab. 3, illustr. 1, bibliogr. 25.
Keywords:
tabu search, scheduling, due date, tardiness, setup time.
Received: 11.10.2018 Revised: 04.02.2019 Accepted: 27.02.2019
Citation:
P. A. Kononova, Yu. A. Kochetov, “A local search algorithm for the single machine scheduling problem with setups and a storage”, Diskretn. Anal. Issled. Oper., 26:2 (2019), 60–78; J. Appl. Industr. Math., 13:2 (2019), 239–249
Linking options:
https://www.mathnet.ru/eng/da923 https://www.mathnet.ru/eng/da/v26/i2/p60
|
Statistics & downloads: |
Abstract page: | 314 | Full-text PDF : | 228 | References: | 39 | First page: | 10 |
|