Name
Abstract | ||
|---|---|---|
•A problem concerning the joint scheduling of multiple jobs and a maintenance activity on a single machine is addressed. The maintenance activity has an uncertain duration and must be processed within a given time window.•The problem is that of finding job schedules which are robust to any possible changes in the maintenance activity duration.•We investigate properties of robust schedules when minimizing makespan and total completion time objectives under four different robustness criteria.•Exact and heuristic algorithms have been designed and tested for the problem, in which we minimize total completion time under the maximum absolute regret criterion. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1016/j.cor.2019.03.001 | Computers & Operations Research |
Keywords | Field | DocType |
Scheduling,Flexible maintenance,Robust optimization | Mathematical optimization,Heuristic,Single-machine scheduling,Job shop scheduling,Regret,Robust optimization,Scheduling (computing),Robustness (computer science),Schedule,Mathematics | Journal |
Volume | ISSN | Citations |
107 | 0305-0548 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paolo Detti | 1 | 144 | 19.55 |
| Gaia Nicosia | 2 | 143 | 25.16 |
| Andrea Pacifici | 3 | 397 | 31.36 |
| Garazi Zabalo Manrique de Lara | 4 | 2 | 0.84 |