Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1177.90169
Layegh, Jalil; Jolai, Fariborz; Sadegh Amalnik, Mohsen
A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration. (English)
[J] Adv. Eng. Softw. 40, No. 10, 1074-1077 (2009). ISSN 0965-9978

Summary: We consider minimizing total weighted completion time criteria on a single machine. Jobs processing times are step function of its starting time and all jobs have a common due date. First, we present some new lemmas and dominance properties for this NP-hard problem, and then a memetic algorithm using these properties is developed. We compare the solutions of the memetic algorithm with optimal solutions obtained from complete enumeration. The results show that the average percentage error of the proposed algorithm from optimal solutions is about 2\% and as the variance of processing time increase, the percentage errors decrease.

MSC 2000:: *90B35 Scheduling theory

Keywords: scheduling; mean completion time; start time dependency; step-deterioration

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]