An Iterated Local Search Algorithm for the Two-Machine Flow Shop Problem with Buffers and Constant Processing Times on One Machine.
Hoang Thanh LePhiline GeserMartin MiddendorfPublished in: EvoCOP (2019)
Keyphrases
- processing times
- search algorithm
- flowshop
- scheduling jobs
- scheduling problem
- identical machines
- tabu search
- single machine
- setup times
- sequence dependent setup times
- release dates
- makespan minimization
- scheduling decisions
- job processing times
- polynomially solvable
- single machine scheduling problem
- completion times
- precedence relations
- total weighted tardiness
- worst case performance ratio
- shortest processing time
- earliness tardiness
- manufacturing cell
- parallel machines
- search space
- assembly line
- branch and bound
- special case
- resource consumption
- production system
- competitive ratio
- job shop scheduling problem
- search procedure
- np complete