Title :
Scheduling with due dates and deadlines
Author :
Finke, Grzegorz ; Proth, J.-M.
Abstract :
Scheduling problems involving due dates or deadlines are analyzed. Emphasis is placed on the complexity of the problems (polynomially solvable or NP-hard) and on the time complexity of algorithms for polynomially solvable problems or on the kind of algorithms proposed (enumerative, local search, etc.) for other problems.
Keywords :
nonlinear programming; polynomials; scheduling; deadlines; due dates; enumerative algorithms; local search algorithms; problem complexity; scheduling problems; time complexity;
Conference_Titel :
Industrial Electronics, 2002. ISIE 2002. Proceedings of the 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7369-3
DOI :
10.1109/ISIE.2002.1026069
