Please use this identifier to cite or link to this item:
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.
ISSN: 2356-6140
EISSN: 1537-744X
DOI: 10.1155/2015/740750
Rights: Copyright © 2015 Yu-Bin Wu and Ping Ji. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Wu_Due-Window_Assignment_Scheduling.pdf1.91 MBAdobe PDFView/Open
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

Last Week
Last month
Citations as of Mar 12, 2018

Google ScholarTM



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