Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures.
Byung-Gyoo KimByung-Cheon ChoiMyoung-Ju ParkPublished in: Asia Pac. J. Oper. Res. (2017)
Keyphrases
- flowshop
- processing times
- scheduling problem
- special case
- setup times
- bicriteria
- makespan minimization
- total weighted tardiness
- scheduling jobs
- sequence dependent setup times
- asymptotic optimality
- tabu search
- polynomially solvable
- single machine
- single machine scheduling problem
- release dates
- lot streaming
- identical machines
- manufacturing cell
- parallel machines
- np hard
- strongly np hard
- competitive ratio
- scheduling decisions
- job processing times
- reinforcement learning
- cost function
- precedence constraints
- worst case
- production system