This article is cited in 7 scientific papers (total in 7 papers)
Variable neighborhood search for two machine flowshop problem with a passive prefetch
P. A. Kononovaab, Yu. A. Kochetovba
a Sobolev Institute of Mathematics, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
We consider the two machine flowshop scheduling problem with passive loading of the buffer on the second machine. To compute lower bounds for the global optimum, we present four integer linear programming formulations of the problem. Three local search methods with variable neighborhoods are developed for obtaining upper bounds. A new large neighborhood is designed. Our methods use this neighborhood along with some other well-known neighborhoods. For computational experiments, we present a new class of test instances with known global optima. Computational results indicate the high efficiency of the proposed approach for the new class of instances as well as for other classes of instances. Ill. 1, tab. 4, bibliogr. 13.
scheduling theory, local search, exponential neighborhoods.
PDF file (359 kB)
Journal of Applied and Industrial Mathematics, 2013, 7:1, 54–67
P. A. Kononova, Yu. A. Kochetov, “Variable neighborhood search for two machine flowshop problem with a passive prefetch”, Diskretn. Anal. Issled. Oper., 19:5 (2012), 63–82; J. Appl. Industr. Math., 7:1 (2013), 54–67
Citation in format AMSBIB
\by P.~A.~Kononova, Yu.~A.~Kochetov
\paper Variable neighborhood search for two machine flowshop problem with a~passive prefetch
\jour Diskretn. Anal. Issled. Oper.
\jour J. Appl. Industr. Math.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
I. A. Davydov, P. A. Kononova, Yu. A. Kochetov, “Local search with exponential neighborhood for the servers load balancing problem”, J. Appl. Industr. Math., 9:1 (2015), 27–35
Yu. A. Kochetov, A. V. Khmelev, “Hybrid local search for the heterogenous fixed fleet vehicle routing problem”, J. Appl. Industr. Math., 9:4 (2015), 503–518
J. Fung, Ya. Zinder, “Permutation schedules for a two-machine flow shop with storage”, Oper. Res. Lett., 44:2 (2016), 153–157
I. A. Davydov, A. A. Melnikov, P. A. Kononova, “Local search for load balancing problems for servers with large dimension”, Autom. Remote Control, 78:3 (2017), 412–424
H. Gu, J. Memar, Ya. Zinder, “Scheduling batch processing in flexible flowshop with job dependent buffer requirements: Lagrangian relaxation approach”, Walcom: Algorithms and Computation, Walcom 2018, Lecture Notes in Computer Science, 10755, eds. M. Rahman, W. Sung, R. Uehara, Springler, 2018, 119–131
Gu H., Kononov A., Memar J., Zinder Ya., “Efficient Lagrangian Heuristics For the Two-Stage Flow Shop With Job Dependent Buffer Requirements”, J. Discret. Algorithms, 52-53:SI (2018), 143–155
Gu H., Memar J., Zinder Ya., “Efficient Lagrangian Heuristics For the Two-Stage Flow Shop With Job Dependent Buffer Requirements”, Combinatorial Algorithms, Iwoca 2017, Lecture Notes in Computer Science, 10765, eds. Brankovic L., Ryan J., Smyth W., Springer International Publishing Ag, 2018, 312–324
|Number of views:|