English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26987/38787
Visitors : 2279989      Online Users : 35
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/51335

Title: Deteriorating Job Scheduling to Minimize the Number of Late Jobs with Setup Times
Authors: Wen-Chiung Lee
Jian-Bang Lin
Yau-Ren Shiau
Contributors: 國立臺灣海洋大學:海洋文創設計產業學士學位學程
Keywords: Deteriorating jobs
Number of late jobs
Setup time
Date: 2011-10
Issue Date: 2018-11-22T08:48:21Z
Publisher: Computers and Industrial Engineering
Abstract: Abstract: Deteriorating jobs scheduling problems have been widely studied recently. However, research on scheduling problems with deteriorating jobs has rarely considered explicit setup times. With the current emphasis on customer service and meeting the promised delivery dates, we consider a single-machine scheduling problem to minimize the number of late jobs with deteriorating jobs and setup times in this paper. We derive some dominance properties, a lower bound, and an initial upper bound by using a heuristic algorithm to speed up the search process of the branch-and-bound algorithm. Computational experiments show that the algorithm can solve instances up to 1000 jobs in a reasonable amount of time.
Relation: 61(3) pp.782-787
URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/51335
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