On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion Full article
| Journal |
Annals of Operations Research
ISSN: 0254-5330 , E-ISSN: 1572-9338 |
||||
|---|---|---|---|---|---|
| Output data | Year: 2012, Volume: 213, Number: 1, Pages: 253-270 Pages count : 18 DOI: 10.1007/s10479-012-1290-3 | ||||
| Tags | Greedy algorithm; Job shop; Optimal schedule; Preemption; Regular criterion | ||||
| Authors |
|
||||
| Affiliations |
|
Cite:
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
Identifiers:
| Web of science: | WOS:000330340600015 |
| Scopus: | 2-s2.0-84892845130 |
| OpenAlex: | W1981253957 |