Inverse scheduling with maximum lateness objective
Autor(en): | Brucker, Peter Shakhlevich, Natalia V. |
Stichwörter: | Engineering; Engineering, Manufacturing; Inverse optimization; Maximum lateness; Operations Research & Management Science; OPTIMIZATION; Single-machine scheduling | Erscheinungsdatum: | 2009 | Herausgeber: | SPRINGER | Journal: | JOURNAL OF SCHEDULING | Volumen: | 12 | Ausgabe: | 5, SI | Startseite: | 475 | Seitenende: | 488 | Zusammenfassung: | 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. |
Beschreibung: | Biannual Workshop on Models and Algorithms for Planning and Scheduling Problems, Koc Univ, Istanbul, TURKEY, JUL 02-06, 2007 |
ISSN: | 10946136 | DOI: | 10.1007/s10951-009-0117-9 |
Show full item record