Learning and forgetting effects on a group scheduling problem

Wen-Hua Yang

doi:10.1016/j.ejor.2006.03.065

Learning and forgetting effects on a group scheduling problem

2008-06-01

38

PRE

AI

DOI：10.1016/j.ejor.2006.03.065

Original

Original request for help

Save

Abstract

En 中文

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. (C) 2006 Elsevier B.V. All rights reserved.

Keywords:

group scheduling

setup times

learning effect

forgetting effect

Learning and forgetting effects on a group scheduling problem

Abstract

Journal

Organization