带等时空载返程运输的双机Flow shop调度问题复杂性 (Complexity of Flow Shop Scheduling Problems with No-load Return Transportation).
Yan LanMinghui ZhangZongtao WuXin HanPublished in: 计算机科学 (2016)
Keyphrases
- flowshop
- scheduling problem
- processing times
- flowshop scheduling
- single machine
- sequence dependent setup times
- special case
- minimizing makespan
- setup times
- tabu search
- bicriteria
- maximum lateness
- makespan minimization
- total tardiness
- precedence constraints
- asymptotic optimality
- job shop
- open shop
- flowshop scheduling problems
- job shop scheduling
- job shop scheduling problem
- np hard
- total weighted tardiness
- unrelated parallel machines
- preventive maintenance
- permutation flowshop
- completion times
- worst case
- total flowtime
- parallel machines