Technical Note

Journal of the Operational Research Society (2001) 52, 1165–1169. doi:10.1057/palgrave.jors.2601215

Parallel machine scheduling with a learning effect

G Mosheiov1

1The Hebrew University, Jerusalem, Israel

Correspondence: G Mosheiov, School of Business Administration and Department of Statistics, The Hebrew University, Jerusalem 91905, Israel. E-mail: msomer@mscc.huji.ac.il

Received August 2000; Accepted April 2001.

Top

Abstract

The phenomenon of 'learning' has been extensively studied in many different areas of Operational Research. However, the 'learning effect' of the producer/processor has rarely been studied in the general context of production scheduling, and has never been investigated in multi-machine scheduling settings. We focus in this paper on flow-time minimization on parallel identical machines. We show that this problem has a polynomial time solution, although the computational effort required is much larger than the effort required for solving the classical version of the problem.

Keywords:

scheduling, parallel machines, flow-time, learning

Extra navigation

.

Society resources

ADVERTISEMENT
JORS-Link to full archive