Technical Note - Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem.
Jatinder N. D. GuptaS. S. ReddiPublished in: Oper. Res. (1978)
Keyphrases
- flowshop
- scheduling problem
- minimizing total tardiness
- processing times
- sequence dependent setup times
- single machine
- setup times
- bicriteria
- minimizing makespan
- special case
- total tardiness
- tabu search
- flowshop scheduling
- maximum lateness
- makespan minimization
- precedence constraints
- np hard
- parallel machines
- permutation flowshop
- total flowtime
- total weighted tardiness
- strongly np hard
- robotic cell
- flowshop scheduling problems
- release dates
- ant colony optimization
- unrelated parallel machines
- maximum tardiness
- neural network
- preventive maintenance
- polynomially solvable
- job shop scheduling problem