C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
A permutation flow-shop scheduling problem with convex models of operation processing times.
T. C. Edwin Cheng
Adam Janiak
Published in:
Ann. Oper. Res. (2000)
Keyphrases
</>
processing times
scheduling problem
single machine
flowshop
setup times
release dates
identical machines
neural network
learning algorithm
assembly line
scheduling jobs
polynomially solvable
linear programming
total weighted tardiness
precedence relations