-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs.
Ernesto G. BirginJoão Eduardo FerreiraDébora P. RonconiPublished in: Comput. Oper. Res. (2020)
Keyphrases
- flowshop
- completion times
- single machine scheduling problem
- single machine
- weighted number of tardy jobs
- scheduling problem
- sequence dependent setup times
- processing times
- scheduling jobs
- batch processing
- identical machines
- release dates
- unrelated parallel machines
- release times
- parallel machines
- total tardiness
- parallel machine scheduling problem
- special case
- branch and bound algorithm
- strongly np hard
- maximum lateness
- setup times
- open shop
- shortest processing time
- total weighted tardiness
- neural network
- minimizing makespan
- asymptotic optimality
- number of late jobs
- minimize total
- tabu search
- precedence constraints
- identical parallel machines
- job scheduling
- production scheduling
- combinatorial optimization
- np hard
- evolutionary algorithm
- information systems