No-Wait Two-Machine Permutation Flow Shop Scheduling Problem with a Single Server and Separable Setup Times to Minimize Total Tardiness.
Fouad MedouarAbdelhak ElidrissiRachid BenmansourJatinder N. D. GuptaPublished in: CoDIT (2023)
Keyphrases
- minimize total
- setup times
- parallel machines
- single server
- flowshop
- scheduling problem
- sequence dependent setup times
- single machine
- release dates
- precedence constraints
- processing times
- strongly np hard
- state dependent
- special case
- parallel computing
- heavy traffic
- lot sizing
- service times
- holding cost
- shared memory
- dynamic programming
- partial order
- np hard
- search algorithm
- identical parallel machines