Inverse scheduling with maximum lateness objective

Authors:
Peter Brucker;Natalia V. Shakhlevich
Affiliations:
Fachbereich Mathematik/Informatik, Universität Osnabrück, Osnabrück, Germany 49069;School of Computing, University of Leeds, Leeds, UK LS2 9JT
Venue:
Journal of Scheduling
Year:
2009

Citing 4
Cited 2

About strongly polynomial time algorithms for quadratic optimization over submodular constraints

Mathematical Programming: Series A and B
Real-time scheduling algorithm for minimizing maximum weighted error with O (N log N + cN) complexity

Information Processing Letters
Inverse Optimization

Operations Research
Scheduling Algorithms

Scheduling Algorithms

Inverse scheduling: two-machine flow-shop problem

Journal of Scheduling
A note on reverse scheduling with maximum lateness objective

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a range of counterparts of the single-machine scheduling problem with the maximum lateness criterion that arise in the context of inverse optimization. While in the forward scheduling problem all parameters are given and the objective is to find the optimal job sequence for which the value of the maximum lateness is minimum, in inverse scheduling the exact values of processing times or due dates are unknown, and they should be determined so that a prespecified solution becomes optimal. We perform a fairly complete classification of the corresponding inverse models under different types of norms that measure the deviation of adjusted parameters from their given estimates.