Name
Abstract | ||
|---|---|---|
•A new scheduling problem is presented.•The problem is proved to be NP-hard.•A mixed-integer linear programming formulation is provided.•A series of valid cuts strengthens the given formulation.•A MILP-based heuristic is able to tackle large instances more efficiently. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.cor.2017.11.008 | Computers & Operations Research |
Keywords | Field | DocType |
Scheduling,Fair sequences,Mixed-integer programming | Mathematical optimization,Heuristic,Time horizon,Scheduling (computing),Ranging,Integer programming,Linear programming,Conjecture,Optimization problem,Mathematics | Journal |
Volume | Issue | ISSN |
91 | C | 0305-0548 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bruno Jefferson de S. Pessoa | 1 | 0 | 1.01 |
| Daniel Aloise | 2 | 344 | 24.21 |
| Lucídio dos Anjos Formiga Cabral | 3 | 65 | 8.50 |