Work allocation to stations with varying learning slopes and without buffers

Yuval Cohen, Gad Vitner, Subhash Sarin

Research output: Contribution to journalArticlepeer-review


In this paper, we address the problem of allocating the work elements, belonging to the products of a lot, to the stations of an assembly line so as to minimize the makespan. The lots that are processed on the assembly line are characterized by a low overall demand for each product. There is no buffer permitted in between the stations, and the line operates under learning. In particular, the stations' learning slopes are assumed to be different. We present a procedure to determine the optimal assignments of the workload to the stations under learning variability and show that it considerably affects these assignments.

Original languageEnglish
Pages (from-to)797-801
Number of pages5
JournalEuropean Journal of Operational Research
Issue number2
StatePublished - 16 Jan 2008


  • Assembly line
  • Industrial learning
  • Nonlinear programming
  • Work allocation


Dive into the research topics of 'Work allocation to stations with varying learning slopes and without buffers'. Together they form a unique fingerprint.

Cite this