Back to Search
Start Over
Scheduling with a position-weighted learning effect and job release dates.
- Source :
-
Engineering Optimization . Sep2020, Vol. 52 Issue 9, p1475-1493. 19p. - Publication Year :
- 2020
-
Abstract
- This article addresses how to minimize total completion time on a single machine with a position-weighted learning effect. Under non-zero job release dates, a lower bound on the objective function, a number of dominance properties, and an initial solution (i.e. an NEH-based heuristic) are derived, which are used to expedite the elimination process of a branch-and-bound solution procedure. The performance of the branch-and-bound algorithm and the heuristic algorithm are evaluated on a set of randomly generated problem instances. [ABSTRACT FROM AUTHOR]
- Subjects :
- *HEURISTIC algorithms
*MACHINE learning
*COMPUTER scheduling
Subjects
Details
- Language :
- English
- ISSN :
- 0305215X
- Volume :
- 52
- Issue :
- 9
- Database :
- Academic Search Index
- Journal :
- Engineering Optimization
- Publication Type :
- Academic Journal
- Accession number :
- 144848260
- Full Text :
- https://doi.org/10.1080/0305215X.2019.1664498