Name
Abstract | ||
|---|---|---|
In this paper we consider the single machine scheduling problem with truncated exponential learning functions. By the truncated exponential learning functions, we mean that the actual job processing time is a function which depends not only on the total normal processing times of the jobs already processed but also on a control parameter. The use of the truncated function is to model the phenomenon that the learning of a human activity is limited. We show that even with the introduction of the proposed model to job processing times, several single machine problems remain polynomially solvable. For the following three objective functions, the total weighted completion time, the discounted total weighted completion time, the maximum lateness, we present heuristic algorithms according to the corresponding problems without truncated exponential learning functions. We also analyse the worst-case bound of our heuristic algorithms. © 2011 Springer-Verlag. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/s11590-011-0433-9 | Optimization Letters |
Keywords | Field | DocType |
Scheduling,Single machine,Learning effect,Heuristic algorithm | Single-machine scheduling,Heuristic,Mathematical optimization,Learning effect,Exponential function,Scheduling (computing),Heuristic (computer science),Mathematics | Journal |
Volume | Issue | ISSN |
7 | 8 | 18624480 |
Citations | PageRank | References |
10 | 0.52 | 23 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jibo Wang | 1 | 745 | 41.50 |
| Xiao-Yuan Wang | 2 | 42 | 3.99 |
| Linhui Sun | 3 | 53 | 4.15 |
| Linyan Sun | 4 | 96 | 7.16 |