Geodesic
Lower and upper bounds for the optimal makespan in the multimedia problem
Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 1, pp. 59-73

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider a buffer-constrained flow shop problem. We introduce the notion of the restricted problem and show that the original and restricted problems are equivalent. We study two lower bounds for a global optimum. It is shown that the use of the restricted problem can improve the lower bounds. We develop a variable neighborhood search algorithm to obtain the upper bound with some well-known neighborhoods and a new large Kernighan–Lin neighborhood. Computational results show that the proposed method finds optimal solutions or near optimal solutions for difficult examples. Tab. 1, ill. 3, bibliogr. 10.
Keywords: scheduling, flowshop, local search. 
@article{DA_2012_19_1_a4,
     author = {P. A. Kononova},
     title = {Lower and upper bounds for the optimal makespan in the multimedia problem},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {59--73},
     publisher = {mathdoc},
     volume = {19},
     number = {1},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2012_19_1_a4/}
}
TY  - JOUR
AU  - P. A. Kononova
TI  - Lower and upper bounds for the optimal makespan in the multimedia problem
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2012
SP  - 59
EP  - 73
VL  - 19
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2012_19_1_a4/
LA  - ru
ID  - DA_2012_19_1_a4
ER  - 
%0 Journal Article
%A P. A. Kononova
%T Lower and upper bounds for the optimal makespan in the multimedia problem
%J Diskretnyj analiz i issledovanie operacij
%D 2012
%P 59-73
%V 19
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2012_19_1_a4/
%G ru
%F DA_2012_19_1_a4
P. A. Kononova. Lower and upper bounds for the optimal makespan in the multimedia problem. Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 1, pp. 59-73. http://geodesic.mathdoc.fr/item/DA_2012_19_1_a4/