Minimizing makespan for solving the distributed no-wait flowshop scheduling problem.
Shih-Wei LinKuo-Ching YingPublished in: Comput. Ind. Eng. (2016)
Keyphrases
- minimizing makespan
- scheduling problem
- flowshop
- total flowtime
- maximum tardiness
- single machine
- flowshop scheduling problems
- processing times
- tabu search
- setup times
- parallel machines
- strongly np hard
- np hard
- flowshop scheduling
- distributed systems
- bicriteria
- makespan minimization
- minimizing total tardiness
- maximum lateness
- permutation flowshop
- combinatorial optimization
- precedence constraints
- total tardiness
- preventive maintenance
- job shop scheduling problem
- multistage
- special case