| DC Field | Value | Language |
|---|
| dc.contributor.author | Lushchakova, I. N. | - |
| dc.contributor.author | Soper, A. J. | - |
| dc.contributor.author | Strusevich, V. A. | - |
| dc.date.accessioned | 2016-06-27T12:04:41Z | - |
| dc.date.accessioned | 2017-07-27T12:12:38Z | - |
| dc.date.available | 2016-06-27T12:04:41Z | - |
| dc.date.available | 2017-07-27T12:12:38Z | - |
| dc.date.issued | 2009 | - |
| dc.identifier.citation | Lushchakova, I. N. Transporting jobs through a two-machine open shop / I. N. Lushchakova, A. J. Soper, V. A. Strusevich // Naval Research Logistics, 56 (1). – 2009. - Рp. 1-18. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/7816 | - |
| dc.description.abstract | We consider the two-machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a 7/5-approximation algorithm. © 2008 Wiley Periodicals, Inc. | ru_RU |
| dc.language.iso | en | ru_RU |
| dc.subject | публикации ученых | ru_RU |
| dc.subject | approximation algorithm | ru_RU |
| dc.subject | open shop | ru_RU |
| dc.subject | scheduling with transportation | ru_RU |
| dc.title | Transporting jobs through a two-machine open shop | ru_RU |
| dc.type | Article | ru_RU |
| Appears in Collections: | Публикации в зарубежных изданиях
|
