Advanced search
2 files | 2.46 MB Add to list

A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem

Tessa Borgonjon (UGent) and Broos Maenhout (UGent)
Author
Organization
Abstract
This paper considers the personnel task rescheduling problem, which arises due to the occurrence of operational uncertainty, making the initial baseline schedule infeasible. To restore the feasibility, the personnel task rescheduling problem should be solved, which considers two conflicting objectives, i.e. the maximisation of the service level and the minimisation of the resource schedule deviations. To facilitate the decision making process and decrease the subjectivity of the decision-maker, a multi-objective optimisation approach is designated to offer a set of alternative solutions to the different stakeholders, making an adequate trade-off between both objectives to improve schedule acceptance. To that purpose, we present a two-stage multi objective decomposition approach targeted at generating a set of evenly spaced non-dominated solutions that compose a representative Pareto front. The first stage comprises an adaptive weight-based method to construct an initial set of solutions. The second stage of our approach further explores the solution space by inducing a constraint-based method to improve the distribution of the solution points. Several computational experiments are conducted to evaluate the solution quality and computational efficiency of the proposed method. We benchmark the performance of the two-stage approach with other multi-objective solution approaches constructing a Pareto front and validate the design choices made in both stages.
Keywords
Management Science and Operations Research, Modelling and Simulation, General Computer Science, Multi-objective optimisation, Personnel task rescheduling, Pareto front, Branch-and-price

Downloads

  • (...).pdf
    • full text (Accepted manuscript)
    • |
    • UGent only (changes to open access on 2023-03-01)
    • |
    • PDF
    • |
    • 1.12 MB
  • (...).pdf
    • full text (Published version)
    • |
    • UGent only
    • |
    • PDF
    • |
    • 1.34 MB

Citation

Please use this url to cite or link to this publication:

MLA
Borgonjon, Tessa, and Broos Maenhout. “A Two-Phase Pareto Front Method for Solving the Bi-Objective Personnel Task Rescheduling Problem.” COMPUTERS & OPERATIONS RESEARCH, vol. 138, 2022, doi:10.1016/j.cor.2021.105624.
APA
Borgonjon, T., & Maenhout, B. (2022). A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem. COMPUTERS & OPERATIONS RESEARCH, 138. https://doi.org/10.1016/j.cor.2021.105624
Chicago author-date
Borgonjon, Tessa, and Broos Maenhout. 2022. “A Two-Phase Pareto Front Method for Solving the Bi-Objective Personnel Task Rescheduling Problem.” COMPUTERS & OPERATIONS RESEARCH 138. https://doi.org/10.1016/j.cor.2021.105624.
Chicago author-date (all authors)
Borgonjon, Tessa, and Broos Maenhout. 2022. “A Two-Phase Pareto Front Method for Solving the Bi-Objective Personnel Task Rescheduling Problem.” COMPUTERS & OPERATIONS RESEARCH 138. doi:10.1016/j.cor.2021.105624.
Vancouver
1.
Borgonjon T, Maenhout B. A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem. COMPUTERS & OPERATIONS RESEARCH. 2022;138.
IEEE
[1]
T. Borgonjon and B. Maenhout, “A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem,” COMPUTERS & OPERATIONS RESEARCH, vol. 138, 2022.
@article{8726642,
  abstract     = {{This paper considers the personnel task rescheduling problem, which arises due to the occurrence of operational uncertainty, making the initial baseline schedule infeasible. To restore the feasibility, the personnel task rescheduling problem should be solved, which considers two conflicting objectives, i.e. the maximisation of the service level and the minimisation of the resource schedule deviations. To facilitate the decision making process and decrease the subjectivity of the decision-maker, a multi-objective optimisation approach is designated to offer a set of alternative solutions to the different stakeholders, making an adequate trade-off between both objectives to improve schedule acceptance. To that purpose, we present a two-stage multi objective decomposition approach targeted at generating a set of evenly spaced non-dominated solutions that compose a representative Pareto front. The first stage comprises an adaptive weight-based method to construct an initial set of solutions. The second stage of our approach further explores the solution space by inducing a constraint-based method to improve the distribution of the solution points. Several computational experiments are conducted to evaluate the solution quality and computational efficiency of the proposed method. We benchmark the performance of the two-stage approach with other multi-objective solution approaches constructing a Pareto front and validate the design choices made in both stages.}},
  articleno    = {{105624}},
  author       = {{Borgonjon, Tessa and Maenhout, Broos}},
  issn         = {{0305-0548}},
  journal      = {{COMPUTERS & OPERATIONS RESEARCH}},
  keywords     = {{Management Science and Operations Research,Modelling and Simulation,General Computer Science,Multi-objective optimisation,Personnel task rescheduling,Pareto front,Branch-and-price}},
  language     = {{eng}},
  pages        = {{23}},
  title        = {{A two-phase Pareto front method for solving the bi-objective personnel task rescheduling problem}},
  url          = {{http://dx.doi.org/10.1016/j.cor.2021.105624}},
  volume       = {{138}},
  year         = {{2022}},
}

Altmetric
View in Altmetric
Web of Science
Times cited: