The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times.
In: Applied Mathematics & Computation, Jg. 221 (2013-09-15), S. 819-832
Online
academicJournal
Highlights: [•] The two-processor flowshop makespan scheduling with piecewise linear position learning/aging effects is strongly NP-hard. [•] The two-processor flowshop makespan scheduling with common linear position learning/aging effects is polynomially solvable. [•] The boundary between polynomially solvable and NP-hard has been is compressed. [•] The strong NP-hardness proof supporting method is described. [Copyright &y& Elsevier]
Titel: |
The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times.
|
---|---|
Autor/in / Beteiligte Person: | Rudek, Radosław |
Link: | |
Zeitschrift: | Applied Mathematics & Computation, Jg. 221 (2013-09-15), S. 819-832 |
Veröffentlichung: | 2013 |
Medientyp: | academicJournal |
ISSN: | 0096-3003 (print) |
DOI: | 10.1016/j.amc.2013.06.086 |
Schlagwort: |
|
Sonstiges: |
|