Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/8735
Title: Due-window assignment scheduling with variable job processing times
Authors: Wu, YB
Ji, P 
Issue Date: 2015
Publisher: Hindawi Publishing Corporation
Source: The scientific world journal, 2015, v. 2015, 740750 How to cite?
Journal: The scientific world journal 
Abstract: We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time.
URI: http://hdl.handle.net/10397/8735
ISSN: 2356-6140
EISSN: 1537-744X
DOI: 10.1155/2015/740750
Appears in Collections:Journal/Magazine Article

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

Page view(s)

33
Last Week
2
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



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