Name
Abstract | ||
|---|---|---|
We study scheduling problems on a proportionate flowshop. Three objective functions are considered: minimum makespan, minimum total completion time, and minimum total load. We consider a learning process; thus, the processing time of a job processed later in sequence is reduced. The scheduler has the option of job rejection; i.e., only a subset of the jobs are processed and the rejected jobs are penalized. An upper bound on the total permitted rejection cost is assumed. Since the single-machine versions of these problems were shown to be NP-hard, we focus on the introduction of pseudopolynomial dynamic programming algorithms, indicating that the problems are NP-hard in the ordinary sense. We provide an extensive numerical study verifying that the proposed solution algorithms are very efficient and instances containing up to 80 jobs are solved in no more than 5 ms. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s10951-019-00612-y | JOURNAL OF SCHEDULING |
Keywords | DocType | Volume |
Scheduling, Proportionate flowshop, Learning effect, Job rejection, Dynamic programming | Journal | 23 |
Issue | ISSN | Citations |
6 | 1094-6136 | 1 |
PageRank | References | Authors |
0.35 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Baruch Mor | 1 | 154 | 16.10 |
| Gur Mosheiov | 2 | 1 | 1.36 |
| Dana Shapira | 3 | 144 | 32.15 |