Scheduling problems with a learning effect

Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

323 Scopus citations

Abstract

In many realistic settings, the production facility (a machine, a worker) improves continuously as a result of repeating the same or similar activities; hence, the later a given product is scheduled in the sequence, the shorter its production time. This "learning effect" is investigated in the context of various scheduling problems. It is shown in several examples that although the optimal schedule may be very different from that of the classical version of the problem, and the computational effort becomes significantly greater, polynomial-time solutions still exist. In particular, we introduce polynomial solutions for the single-machine makespan minimization problem, and two for multi-criteria single-machine problems and the minimum flow-time problem on parallel identical machines.

Original languageAmerican English
Pages (from-to)687-693
Number of pages7
JournalEuropean Journal of Operational Research
Volume132
Issue number3
DOIs
StatePublished - 1 Aug 2001

Bibliographical note

Funding Information:
This paper was supported in part by the Recanati Fund of the School of Business Administration, The Hebrew University, Jerusalem, Israel.

Keywords

  • Learning
  • Parallel machines
  • Scheduling
  • Single-machine

Fingerprint

Dive into the research topics of 'Scheduling problems with a learning effect'. Together they form a unique fingerprint.

Cite this