Name
Abstract | ||
|---|---|---|
•Studying lot scheduling problems with order split and no-split.•Proposing a polynomial solution for minimizing the number of tardy orders (split).•Providing a pseudo-polynomial solution for the weighted version (split).•Proving strongly NP-hardness for the minimum number of tardy orders (no-split).•Introducing a heuristic for the no-split problem. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.ipl.2020.106009 | Information Processing Letters |
Keywords | DocType | Volume |
Scheduling,Lot scheduling,Single machine,Number of tardy orders,Dynamic programming | Journal | 164 |
ISSN | Citations | PageRank |
0020-0190 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Baruch Mor | 1 | 154 | 16.10 |
| Gur Mosheiov | 2 | 1073 | 105.02 |
| Dana Shapira | 3 | 144 | 32.15 |