Single machine group scheduling with learning effects and past-sequence-dependent setup times

Chinyao Low and Wen-Yi Lin

International Journal of Systems Science, 2011, vol. 43, issue 1, 1-8

Abstract: In most studies, the learning effect model applied in a scheduling problem assumes that the actual processing time of a job is a function of its scheduled position or the sum of the normal processing times of the jobs already scheduled. In this article, we introduce a learning effect model and a past-sequence-dependent (psd) setup time into a single machine group scheduling problem. The actual processing time of a job in each group is a function of the sum of the normal processing times of the jobs already scheduled and the position of the corresponding job group in the sequence. It shows that the addressed problem remains polynomially solvable for the objectives: minimisation of the makespan and the total completion time. It also shows that the smallest processing time rule provides the optimal jobs sequence in each group and the optimal group sequence for the addressed problem, respectively.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/00207721003731629 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:tsysxx:v:43:y:2011:i:1:p:1-8

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/TSYS20

DOI: 10.1080/00207721003731629

Access Statistics for this article

International Journal of Systems Science is currently edited by Visakan Kadirkamanathan

More articles in International Journal of Systems Science from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().