Outsourcing Decisions in M-Machine Permutation Flow shop Scheduling Problems with Machine-dependent Processing times.
Byung-Cheon ChoiMyoung-Ju ParkPublished in: Asia Pac. J. Oper. Res. (2014)
Keyphrases
- flowshop
- processing times
- scheduling problem
- sequence dependent setup times
- single machine
- bicriteria
- setup times
- special case
- makespan minimization
- total weighted tardiness
- asymptotic optimality
- np hard
- minimizing makespan
- release dates
- parallel machines
- scheduling decisions
- precedence constraints
- tabu search
- maximum lateness
- polynomially solvable
- job shop
- identical machines
- job shop scheduling
- scheduling jobs
- earliness tardiness
- job processing times
- strongly np hard
- single machine scheduling problem
- job shop scheduling problem
- completion times
- manufacturing cell
- resource consumption
- unrelated parallel machines
- lower bound
- feasible solution
- np complete
- cost function
- computational complexity