Flowshop Scheduling Problems with a Position-Dependent Exponential Learning Effect
Author
Source
Mathematical Problems in Engineering
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-5, 5 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-09-09
Country of Publication
Egypt
No. of Pages
5
Main Subjects
Abstract EN
We consider a permutation flowshop scheduling problem with a position-dependent exponential learning effect.
The objective is to minimize the performance criteria of makespan and the total flow time.
For the two-machine flow shop scheduling case, we show that Johnson’s rule is not an optimal algorithm for minimizing the makespan given the exponential learning effect.
Furthermore, by using the shortest total processing times first (STPT) rule, we construct the worst-case performance ratios for both criteria.
Finally, a polynomial-time algorithm is proposed for special cases of the studied problem.
American Psychological Association (APA)
Cheng, Mingbao. 2013. Flowshop Scheduling Problems with a Position-Dependent Exponential Learning Effect. Mathematical Problems in Engineering،Vol. 2013, no. 2013, pp.1-5.
https://search.emarefa.net/detail/BIM-1010629
Modern Language Association (MLA)
Cheng, Mingbao. Flowshop Scheduling Problems with a Position-Dependent Exponential Learning Effect. Mathematical Problems in Engineering No. 2013 (2013), pp.1-5.
https://search.emarefa.net/detail/BIM-1010629
American Medical Association (AMA)
Cheng, Mingbao. Flowshop Scheduling Problems with a Position-Dependent Exponential Learning Effect. Mathematical Problems in Engineering. 2013. Vol. 2013, no. 2013, pp.1-5.
https://search.emarefa.net/detail/BIM-1010629
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1010629