Login / Signup
Lower bound development in a flow shop electronic assembly problem with carryover sequence-dependent setup time.
M. T. Yazdani Sabouni
Rasaratnam Logendran
Published in:
Comput. Ind. Eng. (2018)
Keyphrases
</>
lower bound
flowshop
scheduling problem
upper bound
np hard
setup times
flowshop scheduling
flowshop scheduling problems
objective function
asymptotic optimality
dynamic programming
tabu search
branch and bound algorithm
manufacturing systems
precedence constraints
job shop
strongly np hard