Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/8011
Title: Due-date determination with resequencing
Authors: Li, CL 
Issue Date: 1999
Publisher: Taylor & Francis
Source: IIE transactions, 1999, v. 31, no. 2, p. 183-188 How to cite?
Journal: IIE transactions 
Abstract: Traditional scheduling and due-date determination models assume that the production system is operating in a static and deterministic environment and that the system carries no workload at each scheduling epoch. In this research we consider a due-date determination model where the scheduler wishes to update the existing schedule when some new jobs have arrived into the system. In this model, jobs are categorized as either `old' or `new' jobs, where the due-dates of the old jobs are treated as given parameters and those of the new jobs are decision variables. The objective is to minimize the maximum weighted tardiness penalty and the due-date assignment cost. The computational complexity of this model is analyzed, and an efficient algorithm is developed for an important special case.
URI: http://hdl.handle.net/10397/8011
ISSN: 0740-817X
EISSN: 1545-8830
DOI: 10.1023/A:1007550328128
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

13
Last Week
0
Last month
0
Citations as of Oct 11, 2017

Page view(s)

42
Last Week
2
Last month
Checked on Oct 16, 2017

Google ScholarTM

Check

Altmetric



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