A Neutrosophic Number-Based Memetic Algorithm for the Integrated Process Planning and Scheduling Problem With Uncertain Processing Times.
Liangliang JinChaoyong ZhangXiaoyu WenGeorge Gershom ChristopherPublished in: IEEE Access (2020)
Keyphrases
- scheduling problem
- processing times
- memetic algorithm
- tabu search
- single machine
- flowshop
- setup times
- process planning
- earliness tardiness
- job shop scheduling problem
- release dates
- np hard
- production scheduling
- job shop
- genetic programming
- computational complexity
- total weighted tardiness
- fixed number
- makespan minimization
- neural network
- computer aided
- evolutionary computation
- precedence constraints
- single machine scheduling problem
- multi objective