The coordinated production and transportation scheduling problem with a time-sensitive product: a branch-and-cut algorithm.
Ismail KaraoglanSaadettin Erhan KesenPublished in: Int. J. Prod. Res. (2017)
Keyphrases
- scheduling problem
- experimental evaluation
- k means
- np hard
- detection algorithm
- computational complexity
- dynamic programming
- transportation problem
- high accuracy
- probabilistic model
- objective function
- learning algorithm
- recognition algorithm
- preprocessing
- expectation maximization
- linear programming
- significant improvement
- optimization algorithm
- segmentation algorithm
- worst case
- optimal solution
- search space
- cost function
- simulated annealing
- multi agent
- evolutionary algorithm
- production planning