Worst-case analysis for flow shop scheduling with a learning effect

Zhiyong Xu, Linyan Sun and Gong Juntao ()

International Journal of Production Economics, 2008, vol. 113, issue 2, 748-753

Abstract: We consider flow shop scheduling problems with a learning effect. In this model the processing times of jobs are defined as functions of their positions in a permutation. The objective is to minimize one of the three regular performance criteria, namely, the total weighted completion time, the discounted total weighted completion time, and the sum of the quadratic job completion times. We present algorithms by using the optimal permutations for the corresponding single machine scheduling problems. We also analyze the worst-case bound of our algorithms.

Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925-5273(07)00330-1
Full text for ScienceDirect subscribers only

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:eee:proeco:v:113:y:2008:i:2:p:748-753

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().