Back to Search
Start Over
Solution algorithms for the number of tardy jobs minimisation scheduling with a time-dependent learning effect.
- Source :
- International Journal of Production Research; Jun2017, Vol. 55 Issue 11, p3141-3148, 8p
- Publication Year :
- 2017
-
Abstract
- This paper deals with a single-machine scheduling problem with a time-dependent learning effect. The goal is to determine the job sequence that minimise the number of tardy jobs. Two dominance properties, two heuristic algorithms and a lower bound to speed up the search process of the branch-and-bound algorithm are proposed. Computational experiments show that the branch-and-bound algorithm can solve instances up to 18 jobs in a reasonable amount of time, and the proposed heuristic algorithm MFLA performs effectively and efficiently [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 00207543
- Volume :
- 55
- Issue :
- 11
- Database :
- Complementary Index
- Journal :
- International Journal of Production Research
- Publication Type :
- Academic Journal
- Accession number :
- 122554270
- Full Text :
- https://doi.org/10.1080/00207543.2016.1264642