A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation.
Pawel Jan KalczynskiJerzy KamburowskiPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- scheduling jobs
- strongly np hard
- flowshop
- unrelated parallel machines
- batch processing
- scheduling problem
- completion times
- parallel machine scheduling problem
- single machine
- parallel machines
- processing times
- optimal solution
- tabu search
- lower bound
- setup times
- permutation flowshop
- np hard
- approximation algorithms
- production system
- wavelet coefficients
- sequence dependent setup times
- maximum lateness
- minimizing makespan
- linear combination
- search algorithm
- single machine scheduling problem
- branch and bound algorithm
- open shop
- reinforcement learning
- identical parallel machines
- lot streaming
- job shop
- heuristic methods
- job shop scheduling problem
- globally optimal
- search strategies
- feasible solution
- wavelet transform
- dynamic programming