|
|||||
|
|
Approximation of the supply scheduling problem |
|
| Authors: | Satyaveer S Chauhan |
| Institution: | a INRIA-SAGEP, UFR Scientifique, Université de Metz, Ile du Saulcy, 57045 Metz, France b Omsk Branch of Sobolev Institute of Mathematics SB RAS, Pevtsov street 13, 644099 Omsk, Russia c Department of Mathematics, Omsk State University, Mira prospect 55A, 644077 Omsk, Russia d Omsk Branch of Sobolev Institute of Mathematics SB RAS, Pevtsov street 13, 644099 Omsk, Russia e Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands |
| Abstract: | The supply scheduling problem consists in finding a minimum cost delivery plan from a set of providers to a manufacturing unit, subject to given bounds on the shipment sizes and subject to the demand at the manufacturing unit. We provide a fully polynomial time approximation scheme for this problem. |
| Keywords: | Combinatorial optimization Approximation algorithm Approximation scheme |
| 本文献已被 ScienceDirect 等数据库收录！ | |