Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/11743
DC FieldValueLanguage
dc.contributorDepartment of Logistics and Maritime Studies-
dc.creatorCheng, TCE-
dc.creatorDing, Q-
dc.creatorKovalyov, MY-
dc.creatorBachman, A-
dc.creatorJaniak, A-
dc.date.accessioned2014-12-19T06:57:08Z-
dc.date.available2014-12-19T06:57:08Z-
dc.identifier.issn0894-069X-
dc.identifier.urihttp://hdl.handle.net/10397/11743-
dc.language.isoenen_US
dc.publisherJohn Wiley & Sonsen_US
dc.subjectComputational complexityen_US
dc.subjectMachine schedulingen_US
dc.subjectStart time dependent processing timesen_US
dc.titleScheduling Jobs with Piecewise Linear Decreasing Processing Timesen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage531-
dc.identifier.epage554-
dc.identifier.volume50-
dc.identifier.issue6-
dc.identifier.doi10.1002/nav.10073-
dcterms.abstractWe study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP-hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP-hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems.-
dcterms.bibliographicCitationNaval research logistics, 2003, v. 50, no. 6, p. 531-554-
dcterms.isPartOfNaval research logistics-
dcterms.issued2003-
dc.identifier.isiWOS:000185079900001-
dc.identifier.scopus2-s2.0-0141828947-
dc.identifier.eissn1520-6750-
dc.identifier.rosgroupidr12762-
dc.description.ros2002-2003 > Academic research: refereed > Publication in refereed journal-
Appears in Collections:Journal/Magazine Article
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

SCOPUSTM   
Citations

52
Last Week
0
Last month
0
Citations as of Sep 4, 2020

WEB OF SCIENCETM
Citations

49
Last Week
0
Last month
0
Citations as of Oct 12, 2020

Page view(s)

165
Last Week
2
Last month
Citations as of Oct 14, 2020

Google ScholarTM

Check

Altmetric


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