| DC Field | Value | Language |
|---|
| dc.contributor.author | Egorova, N. G. | - |
| dc.contributor.author | Sotskov, Y. N. | - |
| dc.contributor.author | Werner, F. | - |
| dc.date.accessioned | 2016-11-29T11:45:52Z | - |
| dc.date.accessioned | 2017-07-27T12:26:54Z | - |
| dc.date.available | 2016-11-29T11:45:52Z | - |
| dc.date.available | 2017-07-27T12:26:54Z | - |
| dc.date.issued | 2007 | - |
| dc.identifier.citation | Egorova, N. G. Sequence-dependent setup times in a two-machine makespan job-shop scheduling problem / N. G. Egorova, Y. N. Sotskov, F. Werner // ECCO XX-2007: 20th Anniversary Conference of the European Chapter on Combinatorial Optimization, – Cyprus, Limassol, (24–26 May 2007) / Center for Banking and Financial Research and Department of Public and Business Administration University of Cyprus. - Limassol, 2007. – Р. 30–31. | ru_RU |
| dc.identifier.uri | https://libeldoc.bsuir.by/handle/123456789/10444 | - |
| dc.description.abstract | job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup times and removal times is consider. The processing of each job includes at most two operations that have to be non-preemptive. Machine routes may differ from job to job. If all setup and removal times are equal to zero, this problem is polynomially solvable via Jackson's permutations, otherwise it is NP-hard even if each of n jobs consists of one operation on the same machine. We present sufficient conditions when Jackson’s permutations may be used for solving the two-machine job-shop problem with sequence-dependent setup times and removal times. For the general case of this problem, the results obtained provide polynomial lower and upper bounds for the makespan which are used in a branch-and-bound algorithm. | ru_RU |
| dc.language.iso | en | ru_RU |
| dc.subject | публикации ученых | ru_RU |
| dc.subject | планирование | ru_RU |
| dc.subject | одностадийное обслуживание требований | ru_RU |
| dc.subject | взвешенные моменты завершения обслуживания требований | ru_RU |
| dc.subject | устойчивость | ru_RU |
| dc.subject | неопределенность | ru_RU |
| dc.subject | интервальные длительности обслуживания требований | ru_RU |
| dc.subject | scheduling | ru_RU |
| dc.subject | single machine problems | ru_RU |
| dc.subject | total weighted completion times | ru_RU |
| dc.subject | stability | ru_RU |
| dc.subject | uncertainty | ru_RU |
| dc.subject | interval processing times | ru_RU |
| dc.title | Sequence-dependent setup times in a two-machine makespan job-shop scheduling problem | ru_RU |
| dc.type | Article | ru_RU |
| Appears in Collections: | Публикации в зарубежных изданиях
|
