Minimizing the number of tardy jobs under piecewise-linear deterioration.
Ghasem MoslehiAbbasali JafariPublished in: Comput. Ind. Eng. (2010)
Keyphrases
- piecewise linear
- number of tardy jobs
- single machine
- processing times
- single machine scheduling problem
- dynamic programming
- flowshop
- scheduling problem
- chaotic map
- branch and bound algorithm
- resource consumption
- regression algorithm
- special case
- convex functions
- hyperplane
- differential evolution
- learning algorithm
- np hard
- lagrangian relaxation
- training set
- optimal solution