An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times.
Pawel Jan KalczynskiJerzy KamburowskiPublished in: Comput. Oper. Res. (2012)
Keyphrases
- release times
- processing times
- single machine
- scheduling problem
- single machine scheduling problem
- release dates
- number of late jobs
- completion times
- scheduling jobs
- deteriorating jobs
- maximum lateness
- combinatorial optimization
- precedence constraints
- sequence dependent setup times
- flowshop
- steady state
- learning effect
- resource consumption
- identical parallel machines
- tabu search
- genetic algorithm
- competitive ratio