The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time.
Ling-Huey SuYuan-Yu LeePublished in: Comput. Oper. Res. (2008)
Keyphrases
- flowshop
- single server
- scheduling problem
- parallel machines
- special case
- setup times
- retrial queue
- minimizing total tardiness
- identical parallel machines
- flowshop scheduling
- sequence dependent setup times
- total tardiness
- processing times
- single machine
- minimizing makespan
- makespan minimization
- state dependent
- strongly np hard
- precedence constraints
- maximum lateness
- bicriteria
- unrelated parallel machines
- np hard
- total weighted tardiness
- total flowtime
- permutation flowshop
- job shop scheduling problem
- heavy traffic
- tabu search
- release dates
- queueing networks
- preventive maintenance
- markov chain
- single machine scheduling problem
- completion times
- holding cost
- genetic algorithm
- computational complexity
- optimal solution