Single-machine scheduling with accelerating learning effects

Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17136

Title:	Single-machine scheduling with accelerating learning effects
Authors:	Cheng, TCE Tseng, SC Lai, PJ Lee, WC
Issue Date:	2013
Source:	Mathematical problems in engineering, 2013, v. 2013, 816235
Abstract:	Scheduling with learning effects has been widely studied. However, there are situations where the learning effect might accelerate. In this paper, we propose a new model where the learning effect accelerates as time goes by. We derive the optimal solutions for the single-machine problems to minimize the makespan, total completion time, total weighted completion time, maximum lateness, maximum tardiness, and total tardiness.
Publisher:	Hindawi Publishing Corporation
Journal:	Mathematical problems in engineering
ISSN:	1024-123X
EISSN:	1563-5147
DOI:	10.1155/2013/816235
Rights:	Copyright © 2013 T. C. E. Cheng et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. The following article: T. C. E. Cheng, Shih-Chang Tseng, Peng-Jen Lai, and Wen-Chiung Lee, “Single-Machine Scheduling with Accelerating Learning Effects,” Mathematical Problems in Engineering, 816235, 2013, is available at https://doi.org/10.1155/2013/816235
Appears in Collections:	Journal/Magazine Article

File	Description	Size	Format
Cheng_Single-machine_scheduling.pdf		1.91 MB	Adobe PDF	View/Open

Status	open access
File Version	Version of Record

View full-text via PolyU eLinks

72

Last Week
0

Last month

Citations as of May 28, 2023

75

Citations as of May 28, 2023

1

Last Week
0

Last month
0

Citations as of May 25, 2023

1

Last Week
0

Last month
0

Citations as of May 25, 2023

Check