Please use this identifier to cite or link to this item:
Title: Algorithms for single-machine scheduling problem with deterioration depending on a novel model
Authors: Wu, HP
Huang, M
Ip, WH 
Fan, QL
Keywords: Scheduling
Deterioration model
Release times
Waiting times
Branch and bound
Rules guided nested partitions
Issue Date: 2017
Publisher: American Institute of Mathematical Sciences
Source: Journal of industrial and management optimization, 2017, v. 13, no. 2, p. 681-695 How to cite?
Journal: Journal of industrial and management optimization 
Abstract: In this paper, a novel single machine scheduling problem with deterioration depending on waiting times is investigated. Firstly, a new deterioration model for the problem is presented. Secondly, according to characteristics of the problem, dominance properties and lower bounds are proposed and integrated into the Branch and Bound algorithm (B&B) to solve the small-medium scale problems. Thirdly, for solving a large-scale problem, the Rules Guided Nested Partitions method (RGNP) is proposed. The numerical experiments show that when the size of the problem is no more than 17 jobs, the B&B algorithm can obtain the optimal solutions in a reasonable time. The RGNP method can also obtain an average error percentage for near-optimal solutions less than 0.048 within 0.2s. The analysis shows the efficiency of RGNP, and, hence, it can be used for solving large size problems.
ISSN: 1547-5816
EISSN: 1553-166X
DOI: 10.3934/jimo.2016040
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Aug 19, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.