BibTex format
@unpublished{Letsios:2018,
author = {Letsios, D and Misener, R},
title = {Exact lexicographic scheduling and approximate rescheduling},
url = {http://arxiv.org/abs/1805.03437v1},
year = {2018}
}
Publications
Citation
RIS format (EndNote, RefMan)
TY - UNPB
AB - In industrial scheduling, an initial planning phase may solve the nominalproblem and a subsequent recovery phase may intervene to repair inefficienciesand infeasibilities, e.g. due to machine failures and job processing timevariations. This work investigates the minimum makespan scheduling problem withjob and machine perturbations and shows that the recovery problem is stronglyNP-hard, at least as hard as solving the problem with full input knowledge. Weexplore recovery strategies with respect to the (i) planning decisions and (ii)permitted deviations from the original schedule. The resulting performanceguarantees are parameterized by the degree of uncertainty. The analysis derivesfrom the optimal substructure imposed by lexicographic optimality, solexicographic optimization enables more efficient reoptimization. We revisitstate-of-the-art exact lexicographic optimization methods and propose a novellexicographic optimization approach based on branch-and-bound. Numericalanalysis using standard commercial solvers substantiates the method.
AU - Letsios,D
AU - Misener,R
PY - 2018///
TI - Exact lexicographic scheduling and approximate rescheduling
UR - http://arxiv.org/abs/1805.03437v1
UR - http://hdl.handle.net/10044/1/60155
ER -