Login / Signup
A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time.
Lixin Tang
Hua Xuan
Jiyin Liu
Published in:
Comput. Oper. Res. (2006)
Keyphrases
</>
minimize total
relaxation algorithm
flowshop scheduling
single machine
flowshop
scheduling problem
total cost
parallel machines
release dates
relaxation labeling
regularized least squares
lagrangian relaxation
decision trees
processing times
misclassification costs
cost sensitive
branch and bound
pairwise