Synchronous flow shop scheduling with pliable jobs.
Matthias BultmannSigrid KnustStefan WaldherrPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- flowshop
- processing times
- scheduling problem
- total tardiness
- permutation flowshop
- setup times
- single machine
- identical machines
- release dates
- parallel machines
- worst case performance ratio
- special case
- tabu search
- precedence constraints
- minimizing makespan
- parallel machine scheduling problem
- asynchronous communication
- maximum lateness
- identical parallel machines
- np hard
- job scheduling
- scheduling strategy
- neural network
- asymptotic optimality
- hybrid genetic algorithm
- single machine scheduling problem
- website
- computational grids
- minimize total
- databases
- scheduling jobs
- lower bound
- optimal scheduling
- preemptive scheduling
- real time