Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/8735
PIRA download icon_1.1View/Download Full Text
Title: Due-window assignment scheduling with variable job processing times
Authors: Wu, YB
Ji, P 
Issue Date: 2015
Source: The scientific world journal, 2015, v. 2015, 740750
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.
Publisher: Hindawi Publishing Corporation
Journal: The scientific world journal 
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.
The following article: Wu, Y. B., & Ji, P. (2015). Due-window assignment scheduling with variable job processing times. The Scientific World Journal, 2015, is available at https//doi.org/10.1155/2015/740750
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
Wu_Due-Window_Assignment_Scheduling.pdf1.91 MBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page views

98
Last Week
1
Last month
Citations as of Mar 24, 2024

Downloads

87
Citations as of Mar 24, 2024

SCOPUSTM   
Citations

1
Last Week
0
Last month
0
Citations as of Mar 28, 2024

Google ScholarTM

Check

Altmetric


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