Pre-Emptive Scheduling Problems with Controllable Processing Times.
Natalia V. ShakhlevichVitaly A. StrusevichPublished in: J. Sched. (2005)
Keyphrases
- scheduling problem
- single machine
- processing times
- earliness tardiness
- setup times
- flowshop
- tabu search
- maximum lateness
- np hard
- precedence constraints
- job shop scheduling
- sequence dependent setup times
- parallel machines
- job shop scheduling problem
- production scheduling
- job shop
- special case
- lower bound
- deteriorating jobs
- single machine scheduling problem
- neural network
- post treatment
- greedy heuristics
- upper bound
- case study
- real world