Uniform parallel machine scheduling problems with a truncation sum-of-logarithm-processing-times-based learning effect Online publication date: Sat, 27-Feb-2016
by Yang-Kuei Lin; Wei-Hsiang Chuang
International Journal of Internet Manufacturing and Services (IJIMS), Vol. 4, No. 1, 2015
Abstract: In internet manufacturing, a manufacturing cloud usually deals with multiple requests at the same time. Similar problems may appear if a manufacturing cloud is equipped with some kind of intelligence and can learn to process a later job more quickly. This research considers the problem of scheduling jobs on uniform parallel machines to minimise total weighted tardiness (TWT) under a truncation sum-of-logarithm-processing-times-based learning effect. In the proposed learning model, the actual job processing time is a function that depends not only on the processing times of the jobs already processed but also on a control parameter. An iterated local search (ILS) has been proposed to solve this problem. Computational results of applying the ILS to some cases show that the proposed ILS outperforms other metaheuristics (simulated annealing and ant colony optimisation) in terms of TWT. The present research also analyses the impacts of truncation learning effects on objective values.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Manufacturing and Services (IJIMS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook