Learning and forgetting effects on a group scheduling problem |
| |
Authors: | Wen-Hua Yang Suresh Chand |
| |
Institution: | 1. Department of Business Administration, Chaoyang University of Technology, 168, Gifong E. Rd., Wufong, Taichung 413, Taiwan, ROC;2. Krannert School of Management, Purdue University, West Lafayette, IN 47907, USA |
| |
Abstract: | This paper proposes to investigate learning and forgetting effects on the problem of scheduling families of jobs on a single machine to minimize total completion time of jobs. A setup time is incurred whenever the single machine transfers job processing from a family to another family. To analyze the impact of learning and forgetting on this group scheduling problem, we structure three basic models and make some comparisons through computational experiments. The three models, including no forgetting, total forgetting and partial forgetting, assume that the processing time of a job is dependent on its position in a schedule. Some scheduling rules and a lower bound are derived in order to constitute our branch-and-bound algorithm for searching an optimal sequence. In addition, an efficient and simply-structured heuristic is also built to find a near-optimal schedule. |
| |
Keywords: | Group scheduling Setup times Learning effect Forgetting effect |
本文献已被 ScienceDirect 等数据库收录! |
|