Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs.
Hongbin ZhangFeng WuZhen YangPublished in: Comput. Oper. Res. (2021)
Keyphrases
- scheduling problem
- processing times
- parallel machine scheduling problem
- completion times
- single machine
- flowshop
- sum of completion times
- setup times
- total weighted tardiness
- release dates
- earliness tardiness
- np hard
- parallel machines
- permutation flowshop
- identical machines
- total tardiness
- precedence constraints
- minimizing makespan
- unrelated parallel machines
- resource consumption
- sequence dependent setup times
- single machine scheduling problem
- identical parallel machines
- scheduling jobs
- maximum lateness
- limited capacity
- job shop scheduling problem
- tabu search
- randomly generated test problems
- hybrid method
- competitive ratio
- minimize total
- open shop
- strongly np hard
- job shop
- list scheduling
- evolutionary algorithm