A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations.
T. C. Edwin ChengShuenn-Ren ChengWen-Hung WuPeng-Hsiang HsuChin-Chia WuPublished in: Comput. Ind. Eng. (2011)
Keyphrases
- processing times
- single machine scheduling problem
- release dates
- single machine
- scheduling problem
- setup times
- earliness tardiness
- sequence dependent setup times
- completion times
- total weighted tardiness
- neural network
- resource consumption
- release times
- learning effect
- flowshop
- branch and bound algorithm
- combinatorial optimization
- response time
- np hard