Single machine scheduling problems with exponentially time-dependent learning effects |
| |
| Affiliation: | 1. School of Management, Guangdong University of Technology, Guangzhou 510520, PR China;2. Katz Graduate School of Business, University of Pittsburgh, Pittsburgh, PA 15260, United States;1. Univ. Bordeaux, IMS, UMR 5218, F-33405 Talence, France;2. CNRS, IMS, UMR 5218, F-33405 Talence, France;1. National Research University Higher School of Economics, Moscow, Russia;2. Togliatti State University, Togliatti, Russia;3. Volgograd State Technical University, Volgograd, Russia;4. Vyatka State University, Kirov, Russia;1. Retired Medical Officer U.S. Department of Health and Human Services, Washington, D.C., USA |
| |
| Abstract: | In this paper, we introduce a single-machine scheduling problem with an exponentially time-dependent learning effect. The processing time of a job is assumed to be an exponential function of the total normal processing time of jobs already processed before it. For such a scheduling problem, we first provide the upper bound for the maximum lateness and for the total weighted completion time. Next, we show that problems with the following criteria: makespan, the total completion time, the total weighted completion time, the total earliness/tardiness penalties and the maximum lateness under some agreeable conditions, are polynomially solvable. |
| |
| Keywords: | Scheduling Time-dependent Learning effect Upper bound |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
