Journal
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Volume 141, Issue 1, Pages 327-334Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ijpe.2012.08.014
Keywords
Scheduling; Permutation flowshop; Total tardiness; Learning effect
Categories
Funding
- NSC of Taiwan, ROC [NSC 98-2221-E-035-033-MY2]
Ask authors/readers for more resources
Scheduling with learning effects has received considerable attention recently. Often, numbers of operations have to be done on every job in many manufacturing and assembly facilities. However, it is seldom discussed in the general multiple-machine setting, especially without the assumptions of identical processing time on all the machines or dominant machines. With the current emphasis of customer service and meeting the promised delivery dates, we consider a permutation flowshop scheduling problem with learning effects where the objective is to minimize the total tardiness. A branch-and-bound algorithm and two heuristic algorithms are established to search for the optimal and near-optimal solutions. Computational experiments are also given to evaluate the performance of the algorithms. (C) 2012 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available