Makespan minimization flowshop with position dependent job processing times—computational complexity and solution algorithms
In: Computers & operations research, Jg. 40 (2013), Heft 8, S. 2071-2082
Online
academicJournal
- print, 47 ref
This paper considers flowshop scheduling problems where job processing times are described by position dependent functions, i.e., dependent on the number of processed jobs, that model learning or aging effects. We prove that the two-machine flowshop problem to minimize the maximum completion time (makespan) is NP-hard if job processing times are described by non-decreasing position dependent functions (aging effect) on at least one machine and strongly NP-hard if job processing times are varying on both machines. Furthermore, we construct fast NEH, tabu search with a fast neighborhood search and simulated annealing algorithms that solve the problem with processing times described by arbitrary position dependent functions that model both learning and aging effects. The efficiency of the proposed methods is numerically analyzed.
Titel: |
Makespan minimization flowshop with position dependent job processing times—computational complexity and solution algorithms
|
---|---|
Autor/in / Beteiligte Person: | RUDEK, Agnieszka ; RUDEK, Radosław |
Link: | |
Zeitschrift: | Computers & operations research, Jg. 40 (2013), Heft 8, S. 2071-2082 |
Veröffentlichung: | Kidlington: Elsevier, 2013 |
Medientyp: | academicJournal |
Umfang: | print, 47 ref |
ISSN: | 0305-0548 (print) |
Schlagwort: |
|
Sonstiges: |
|