On the Parameterized Tractability of Single Machine Scheduling with Rejection to Minimize the Weighted Makespan.
Ruiqing SunPublished in: NCTCS (2022)
Keyphrases
- completion times
- single machine
- scheduling problem
- open shop
- weighted sum
- processing times
- single machine scheduling problem
- flowshop
- release times
- bicriteria
- unrelated parallel machines
- queue length
- deteriorating jobs
- scheduling jobs
- computational complexity
- np complete
- constraint satisfaction
- maximum tardiness
- real time
- knowledge base
- case study
- release dates
- resource consumption
- precedence constraints
- np hard
- evolutionary algorithm
- special case
- job shop
- neural network
- data sets
- tabu search