Sensitivity Analysis for the Single-Machine Preemptive Scheduling Problem of Minimizing Flow Time.
Xiaoxi LiShanlin LiPublished in: IEEE Access (2023)
Keyphrases
- sensitivity analysis
- single machine
- scheduling problem
- weighted number of tardy jobs
- processing times
- completion times
- managerial insights
- total weighted tardiness
- earliness tardiness
- flowshop
- release dates
- setup times
- total tardiness
- maximum lateness
- release times
- minimize total
- production scheduling
- sequence dependent setup times
- scheduling jobs
- np hard
- precedence constraints
- minimizing makespan
- tabu search
- competitive ratio
- weighted tardiness
- makespan minimization
- parallel machines
- job shop
- special case
- job shop scheduling problem
- computational complexity
- number of late jobs
- upper bound
- evolutionary algorithm
- lower bound