Name
Title | ||
|---|---|---|
A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. |
Abstract | ||
|---|---|---|
•First bi-objective study of the total tardiness single machine problem with rejection.•We provide a Dynamic Program in the case with no hard deadlines.•We provide a Branch and Bound algorithm in the case with hard deadlines.•We display the efficiency of our B&B on benchmark instances. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.cor.2018.10.006 | Computers & Operations Research |
Keywords | Field | DocType |
Scheduling with rejection,Total tardiness,Bi-objective optimization,Dynamic programming,Branch-and-bound | Dynamic programming,Mathematical optimization,Branch and bound,Single-machine scheduling,Tardiness,Scheduling (computing),Multi-objective optimization,Minification,Total cost,Mathematics | Journal |
Volume | ISSN | Citations |
102 | 0305-0548 | 1 |
PageRank | References | Authors |
0.35 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roberto Cordone | 1 | 310 | 28.87 |
| Pierre Hosteins | 2 | 50 | 5.14 |