A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times.
Hiroshi KiseToshihide IbarakiHisashi MinePublished in: Oper. Res. (1978)
Keyphrases
- scheduling problem
- flowshop
- np hard
- special case
- minimizing makespan
- single machine
- parallel machines
- tabu search
- unrelated parallel machines
- processing times
- total tardiness
- parallel machine scheduling problem
- data sets
- sequence dependent setup times
- strongly np hard
- earliness tardiness
- orders of magnitude
- permutation flowshop
- weighted sum
- optimal solution
- machine learning