English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26988/38789
Visitors : 2347000      Online Users : 39
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/51330

Title: A Lower Bound for Minimizing the Total Completion Time of a Three-agent Scheduling Problem
Authors: Yau-Ren Shiau
Wen-Chiung Lee
Yu-Sheng Kung
Jen-Ya Wang
Contributors: 國立臺灣海洋大學:海洋文創設計產業學士學位學程
Keywords: Discrete optimization
Job scheduling
Multiple agents
Maintenance activity
Branch-and-bound algorithm
Date: 2016-01
Issue Date: 2018-11-22T08:20:11Z
Publisher: Information Sciences
Abstract: Abstract: In the field of job scheduling, multi-agent issues have been studied for many years. Most of researchers focused their attention only on two agents. However, there are more than two agents in the real-world scheduling problems. In this study, we consider a single-machine multi-agent scheduling problem with release time and maintenance activity. The objective is to minimize the first agent's total completion time given that the tardiness of jobs from the second agent does not exceed a limit and the maintenance activity from the third agent must be conducted within a specified time interval, i.e., maintenance window. A lower bound is proposed to accelerate the branch-and-bound algorithm. Computational experiments show the proposed lower bound performs well. The improvement ratio even reaches 1789%.
Relation: 340-341 pp.305-320
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51330
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