Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki
 RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Impact factor Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki: Year: Volume: Issue: Page: Find

 Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 2012, Volume 154, Book 3, Pages 180–189 (Mi uzku1149)

Two Schemes of the Branch and Bound Method for a Flow Shop Total Weighted Tardiness Minimization Problem

I. K. Agapeevich, V. R. Fazylov

Kazan (Volga Region) Federal University

Abstract: Two schemes of the branch and bound method for a flow shop total weighted tardiness minimization problem are suggested in this paper. The first scheme consists in the construction of the schedule in the common order (at the beginning the first work in the schedule is chosen, then the second work, etc.) and the second scheme presupposes the construction of the schedule in the inverse order (at the beginning the last work in the schedule is chosen, then the penultimate work, etc.). It is shown by numerical experiments that the efficiency of the methods strongly depends on the problem's parameters, which can be easily calculated from the initial data. Criteria for choosing the most efficient method for any particular problem are proposed.

Keywords: flow shop, branch and bound method, total weighted tardiness minimization.

Full text: PDF file (238 kB)
References: PDF file   HTML file
UDC: 519.854.2

Citation: I. K. Agapeevich, V. R. Fazylov, “Two Schemes of the Branch and Bound Method for a Flow Shop Total Weighted Tardiness Minimization Problem”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 154, no. 3, Kazan University, Kazan, 2012, 180–189

Citation in format AMSBIB
\Bibitem{AgaFaz12} \by I.~K.~Agapeevich, V.~R.~Fazylov \paper Two Schemes of the Branch and Bound Method for a Flow Shop Total Weighted Tardiness Minimization Problem \serial Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki \yr 2012 \vol 154 \issue 3 \pages 180--189 \publ Kazan University \publaddr Kazan \mathnet{http://mi.mathnet.ru/uzku1149}