|
Diskretnyi Analiz i Issledovanie Operatsii, 2008, Volume 15, Issue 5, Pages 47–60
(Mi da549)
|
|
|
|
This article is cited in 3 scientific papers (total in 3 papers)
Optimization of identical jobs production on the base of cyclic schedules
A. A. Romanovaa, V. V. Servakhb a Omsk State University
b Omsk Branch of Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Science
Abstract:
Some cyclic job shop problems with identical jobs are researched. An exact algorithm for one of these problems based on the dynamic programming is proposed. We construct a fully polynomial time approximation scheme in the special case, when the number of simultaneously processing jobs is fixed. Illustr. 1, bibl. 17.
Keywords:
cyclic schedule, identical jobs, dynamic programming, approximation scheme.
Received: 19.12.2007 Revised: 30.07.2008
Citation:
A. A. Romanova, V. V. Servakh, “Optimization of identical jobs production on the base of cyclic schedules”, Diskretn. Anal. Issled. Oper., 15:5 (2008), 47–60; J. Appl. Industr. Math., 3:4 (2009), 496–504
Linking options:
https://www.mathnet.ru/eng/da549 https://www.mathnet.ru/eng/da/v15/i5/p47
|
Statistics & downloads: |
Abstract page: | 468 | Full-text PDF : | 145 | References: | 52 | First page: | 2 |
|