NP-completeness of the Active Time Scheduling Problem.
Sagnik SahaManish PurohitPublished in: CoRR (2021)
Keyphrases
- scheduling problem
- single machine
- np hard
- tabu search
- setup times
- flowshop
- processing times
- job shop scheduling problem
- precedence constraints
- real time
- total tardiness
- minimizing makespan
- earliness tardiness
- parallel machines
- computer vision
- sequence dependent setup times
- permutation flowshop
- steady state
- data structure
- similarity measure
- case study
- website
- search engine
- artificial intelligence
- data sets