Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/16831
Title: Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
Authors: Li, CL 
Cheng, TCE 
Chen, ZL
Issue Date: 1995
Publisher: Pergamon Press
Source: Computers and operations research, 1995, v. 22, no. 2, p. 205-219 How to cite?
Journal: Computers and operations research 
Abstract: We consider a single-machine scheduling problem in which every job has a given target start time and a due-date. A job is early if processing commences before its start time and is tardy if it is completed after its due-date. The objective is to minimize the weighted number of early and tardy jobs, with the restriction that the start times and due-dates are "agreeable", i.e., the start times must increase in the same sequence as the due-dates. We show that the problem is NP-complete in the strong sense. The complexity issues and algorithms for some special cases of this problem are discussed, and heuristic algorithms are developed for the general problem. Computational experiments are conducted to show the effectiveness of the heuristics.
URI: http://hdl.handle.net/10397/16831
ISSN: 0305-0548
EISSN: 1873-765X
DOI: 10.1016/0305-0548(94)E0012-V
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

7
Last Week
0
Last month
0
Citations as of Aug 19, 2017

WEB OF SCIENCETM
Citations

7
Last Week
0
Last month
0
Citations as of Aug 21, 2017

Page view(s)

43
Last Week
3
Last month
Checked on Aug 21, 2017

Google ScholarTM

Check

Altmetric



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