Wednesday, 15:15 - 15:40 h, Room: H 3012


Polina Kononova
Local search heuristic for the buffer-constrained two-stage multimedia scheduling problem

Coauthor: Yury Kochetov


We consider a two-machine flowshop scheduling problem originating in the multimedia industry. It is known that the problem is strongly NP-hard. We present some ILP-reformulations to get lower bounds and VNS-metaheuristic to find optimal or near optimal solutions. The Kernighan-Lin neighborhoods and job-window neighborhoods are used in the VNS framework. For experiments we generate large scale instances with known global optima. Computational results and some open questions are discussed.


Talk 1 of the contributed session Wed.3.H 3012
"Heuristics III" [...]
Cluster 2
"Combinatorial optimization" [...]


  Illinois Payday Loans should not be obtained by people who do not have the capacity to repay the lenders. What can cause long-term use of Viagra? In the network and other sources of information, there is no reliable data on the long-term use of Viagra and its negative effects on the body.