Please use this identifier to cite or link to this item:
Title: Scheduling jobs with simultaneous considerations of controllable processing times and learning effect
Authors: Li, L
Yan, P
Ji, P 
Wang, JB 
Keywords: Controllable processing times
Job-dependent learning curves
Single machine
Issue Date: 2018
Publisher: Springer
Source: Neural computing and applications, 2018, v. 29, no. 11, p. 1155-1162 How to cite?
Journal: Neural computing and applications 
Abstract: This 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.
ISSN: 0941-0643
DOI: 10.1007/s00521-016-2638-4
Appears in Collections:Journal/Magazine Article

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

Page view(s)

Last Week
Last month
Citations as of May 21, 2019

Google ScholarTM



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