Worst case analysis of flow shop scheduling problems with a time-dependent learning effect

Gang Li, Xiao-Yuan Wang, Ji-Bo Wang and Lin-Yan Sun

International Journal of Production Economics, 2013, vol. 142, issue 1, 98-104

Abstract: In this paper we consider flow shop scheduling problems with a time-dependent learning effect. The time-dependent learning effect of a job on a machine is assumed to be a function of the total normal processing time of the jobs scheduled in front of the job on the machine. The objective is to minimize one of the five regular performance criteria namely, the total completion time, the makespan, the total weighted completion time, the total weighted discounted completion time, and the sum of the quadratic job completion times. We present heuristic algorithms by using the optimal permutations for the special cases of the corresponding single machine scheduling problems. We also analyze the worst-case bound of the proposed heuristic algorithms.

Keywords: Scheduling; Flow shop; Learning effect; Heuristic algorithm; Worst-case analysis (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (7)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527312004562
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:142:y:2013:i:1:p:98-104

DOI: 10.1016/j.ijpe.2012.10.015

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 ().