Permutation flow shop scheduling problem to minimize nonlinear objective function with release dates.
Danyu BaiJianheng LiangBingqian LiuMengqian TangZhi-Hai ZhangPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- release dates
- minimize total
- objective function
- processing times
- job processing times
- single machine
- single machine scheduling problem
- scheduling problem
- flowshop
- precedence constraints
- parallel machines
- lower bound
- branch and bound algorithm
- cost function
- resource consumption
- optimization problems
- linear programming
- markov chain
- partially ordered
- special case
- optimal solution