Name
Abstract | ||
|---|---|---|
We consider single machine lot scheduling problems. A number of customer orders of different sizes may be processed in the same lot. Splitting orders between consecutive lots is allowed. Three scheduling measures are considered: makespan, total completion time and total weighted completion time. In all cases, the goal is minimizing the relevant scheduling measure, subject to an upper bound on the total permitted rejection cost. All three problems studied here are NP-hard. We introduce efficient pseudo-polynomial dynamic programming algorithms for all cases. Our numerical tests indicate that the proposed algorithms can solve efficiently large-size problems. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/s10878-020-00651-8 | JOURNAL OF COMBINATORIAL OPTIMIZATION |
Keywords | DocType | Volume |
Lot scheduling, Single machine, Order rejection, Dynamic programming | Journal | 41 |
Issue | ISSN | Citations |
1 | 1382-6905 | 1 |
PageRank | References | Authors |
0.36 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Baruch Mor | 1 | 154 | 16.10 |
| Gur Mosheiov | 2 | 1073 | 105.02 |
| Dana Shapira | 3 | 144 | 32.15 |