Approximation results for the two-machine job shop under limited machine availability
| Autor: | Hatem Hadda |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
0209 industrial biotechnology
Mathematical optimization 021103 operations research Operations research Job shop scheduling Computer science Job shop 0211 other engineering and technologies 02 engineering and technology Flow shop scheduling Management Science and Operations Research Job shop scheduling problem Computer Science Applications Management Information Systems Scheduling (computing) 020901 industrial engineering & automation Information Systems |
| Zdroj: | OPSEARCH. 54:651-662 |
| ISSN: | 0975-0320 0030-3887 |
| DOI: | 10.1007/s12597-017-0298-5 |
| Popis: | This paper tackles the two-machine job shop scheduling problem with limited machine availability under the resumable scenario. We provide a number of characterizations for the optimal solution. We also develop polynomial-time approximation schemes for two particular configurations and identify a polynomially solvable case. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink