Diversity of Processing Times in Permutation Flow Shop Scheduling Problems.
Kathrin MaassenPaz Perez-GonzalezPublished in: OR (2019)
Keyphrases
- processing times
- flowshop
- scheduling problem
- single machine
- setup times
- makespan minimization
- scheduling jobs
- bicriteria
- total weighted tardiness
- sequence dependent setup times
- tabu search
- earliness tardiness
- asymptotic optimality
- maximum lateness
- single machine scheduling problem
- parallel machines
- polynomially solvable
- release dates
- resource consumption
- identical machines
- special case
- job shop
- np hard
- precedence constraints
- strongly np hard
- identical parallel machines
- job shop scheduling
- job shop scheduling problem
- cost function