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" [...]


  The majority of financial loan companies provide the service of getting Payday Loans North Carolina for U.S. citizens. In this section we give only a brief summary recommendation for admission of Levitra. Full information can be found in the instructions for receiving medications with vardenafil.