Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/104491
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Industrial and Systems Engineeringen_US
dc.creatorLi, Len_US
dc.creatorYan, Pen_US
dc.creatorJi, Pen_US
dc.creatorWang, JBen_US
dc.date.accessioned2024-02-05T08:50:25Z-
dc.date.available2024-02-05T08:50:25Z-
dc.identifier.issn0941-0643en_US
dc.identifier.urihttp://hdl.handle.net/10397/104491-
dc.language.isoenen_US
dc.publisherSpringer UKen_US
dc.rights© The Natural Computing Applications Forum 2016en_US
dc.rightsThis version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use (https://www.springernature.com/gp/open-research/policies/accepted-manuscript-terms), but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s00521-016-2638-4.en_US
dc.subjectControllable processing timesen_US
dc.subjectJob-dependent learning curvesen_US
dc.subjectSchedulingen_US
dc.subjectSingle machineen_US
dc.titleScheduling jobs with simultaneous considerations of controllable processing times and learning effecten_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.spage1155en_US
dc.identifier.epage1162en_US
dc.identifier.volume29en_US
dc.identifier.issue11en_US
dc.identifier.doi10.1007/s00521-016-2638-4en_US
dcterms.abstractThis paper considers a scheduling problem with general job-dependent learning curves and controllable processing times on a single machine. The objective is to determine the optimal compressions of the processing times and the optimal sequence of jobs so as to minimize some total cost functions, which consist of regular and non-regular functions and the processing time compressions. It shows that the problem can be solved by an assignment problem and thus can be solved in polynomial time. Some extensions of the problem are also given.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationNeural computing and applications, June 2018, v. 29, no. 11, p. 1155-1162en_US
dcterms.isPartOfNeural computing and applicationsen_US
dcterms.issued2018-06-
dc.identifier.scopus2-s2.0-84992395298-
dc.identifier.eissn1433-3058en_US
dc.description.validate202402 bcchen_US
dc.description.oaAccepted Manuscripten_US
dc.identifier.FolderNumberISE-0650-
dc.description.fundingSourceOthersen_US
dc.description.fundingTextThe Hong Kong Polytechnic University; The National Natural Science Foundation of China; Humanistic Social Science Fund of tge Education Department of Liaoning Province, Chinaen_US
dc.description.pubStatusPublisheden_US
dc.identifier.OPUS6689033-
dc.description.oaCategoryGreen (AAM)en_US
Appears in Collections:Journal/Magazine Article
Files in This Item:
File Description SizeFormat 
Ji_Scheduling_Jobs_Simultaneous.pdfPre-Published version796.31 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Final Accepted Manuscript
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

111
Last Week
6
Last month
Citations as of Nov 30, 2025

Downloads

33
Citations as of Nov 30, 2025

SCOPUSTM   
Citations

6
Citations as of Dec 19, 2025

WEB OF SCIENCETM
Citations

6
Citations as of Dec 18, 2025

Google ScholarTM

Check

Altmetric


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