Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan.
Berkin ToktasMeral AzizogluSuna Kondakci KöksalanPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- scheduling problem
- single machine
- processing times
- flowshop
- release dates
- maximum tardiness
- minimizing makespan
- single machine scheduling problem
- scheduling jobs
- setup times
- unrelated parallel machines
- np hard
- parallel machines
- permutation flowshop
- job shop
- precedence constraints
- single machine scheduling
- multi criteria
- tabu search
- dynamic programming
- selection criteria
- multiple criteria
- evaluation criteria
- open shop
- neural network
- weighted number of tardy jobs
- strongly np hard
- sequence dependent setup times
- completion times
- job shop scheduling problem
- maximum number
- special case
- optimal solution