Scheduling with a common due-window: Polynomially solvable cases.
Gur MosheiovAssaf SarigPublished in: Inf. Sci. (2010)
Keyphrases
- polynomially solvable
- processing times
- scheduling problem
- np complete
- np hard
- special case
- makespan minimization
- scheduling algorithm
- parallel machines
- sliding window
- single machine
- flexible manufacturing systems
- release dates
- window size
- linear programming
- learning algorithm
- round robin
- metaheuristic
- total weighted tardiness
- lower bound
- information systems