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

Title: Single-machine scheduling to minimize totalcompletion time and tardiness with two competing agents
Authors: Wen-Chiung Lee
Yau-Ren Shiau
Yu-Hsiang Chung
Lawson Ding
Contributors: 國立臺灣海洋大學:海洋文創設計產業學士學位學程
Date: 2014-01
Issue Date: 2018-11-22T08:37:37Z
Publisher: The Scientific World Journal
Abstract: Abstract: We consider a single-machine two-agent problem where the objective is to minimize a weighted combination of the total completion time and the total tardiness of jobs from the first agent given that no tardy jobs are allowed for the second agent. A branch-and-bound algorithm is developed to derive the optimal sequence and two simulated annealing heuristic algorithms are proposed to search for the near-optimal solutions. Computational experiments are also conducted to evaluate the proposed branch-and-bound and simulated annealing algorithms.
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51333
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