Bi-criterion Single machine scheduling problem with a past-sequence-dependent setup times and learning effect

機構典藏 > College of Engineering > Graduate Institute & Department of Computer Science and Information Engineering > Proceeding > Item 987654321/121534

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/121534

Title:	Bi-criterion Single machine scheduling problem with a past-sequence-dependent setup times and learning effect
Authors:	Chen, S. H.;Mani, V.;Chen, Y. H.
Keywords:	Indexes;Single machine scheduling;Video recording;Yttrium;Information management;Aerospace engineering;Multimedia communication
Date:	2015-12-06
Issue Date:	2021-10-21 12:11:40 (UTC+8)
Abstract:	This paper considers the bi-criterion single machine scheduling problem of n jobs with a past-sequence-dependent setup times (PSD) and learning effect (LE) together. The two objectives considered are the total completion time (TC) and total absolute differences in completion times (TADC). We consider only the objective TC, we obtain an unique optimal sequence (solution). We study the objective TADC to obtain a unique optimal sequence (solution). If both the TC and TADC are considered together, a set of optimal sequences that performs well with respect to both the objectives TC and TADC would be obtained. This set of optimal sequences is the minimum set of optimal sequences (MSOS). Our purpose in this paper is to find this minimum set of optimal sequences (MSOS) that performs well with respect to both the objectives TC and TADC.
DOI:	10.1109/IEEM.2015.7385633
Appears in Collections:	[Graduate Institute & Department of Computer Science and Information Engineering] Proceeding

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	67	View/Open