On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion Научная публикация
| Журнал |
Annals of Operations Research
ISSN: 0254-5330 , E-ISSN: 1572-9338 |
||||
|---|---|---|---|---|---|
| Вых. Данные | Год: 2012, Том: 213, Номер: 1, Страницы: 253-270 Страниц : 18 DOI: 10.1007/s10479-012-1290-3 | ||||
| Ключевые слова | Greedy algorithm; Job shop; Optimal schedule; Preemption; Regular criterion | ||||
| Авторы |
|
||||
| Организации |
|
Библиографическая ссылка:
Sevastyanov S.V.
, Chemisova D.A.
, Chernykh I.D.
On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
Annals of Operations Research. 2012. V.213. N1. P.253-270. DOI: 10.1007/s10479-012-1290-3 WOS Scopus OpenAlex
On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion
Annals of Operations Research. 2012. V.213. N1. P.253-270. DOI: 10.1007/s10479-012-1290-3 WOS Scopus OpenAlex
Идентификаторы БД:
| Web of science: | WOS:000330340600015 |
| Scopus: | 2-s2.0-84892845130 |
| OpenAlex: | W1981253957 |