English  |  正體中文  |  简体中文  |  Items with full text/Total items : 28603/40634
Visitors : 4416277      Online Users : 525
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51331

Title: Two-agent Two-machine Flowshop Scheduling with Learning Effects to Minimize the Total Completion Time
Authors: Yau-RenShiau
Contributors: 國立臺灣海洋大學:海洋文創設計產業學士學位學程
Keywords: Scheduling
Total completion time
Two agent
Two-machine flowshop
Learning effects
Date: 2015-09
Issue Date: 2018-11-22T08:24:43Z
Publisher: Computers and Industrial Engineering
Abstract: Abstract: We study a two-agent scheduling problem in a two-machine permutation flowshop with learning effects. The objective is to minimize the total completion time of the jobs from one agent, given that the maximum tardiness of the jobs from the other agent cannot exceed a bound. We provide a branch-and-bound algorithm for the problem. In addition, we present several genetic algorithms to obtain near-optimal solutions. Computational results indicate that the algorithms perform well in either solving the problem or efficiently generating near-optimal solutions.
Relation: 87 pp.580-589
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51331
Appears in Collections:[海洋文創設計產業學士學位學程(學系)] 期刊論文

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback