Journal
INFORMATION PROCESSING LETTERS
Volume 114, Issue 8, Pages 399-404Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ipl.2014.02.009
Keywords
Multi-machine; Scheduling; Position-dependent; Total load
Categories
Funding
- National Nature Science Foundation of China [71171046]
- College Graduate Research and Innovation Foundation of Jiangsu Province [CXLX0162]
- Scientific Research Foundation of Graduate School of Southeast University [YBJJ1239]
- National Science and Engineering Research Council of Canada [CISE-539050]
Ask authors/readers for more resources
In this paper, we investigate multi-machine scheduling problems with general position-dependent effects where the actual processing time functions of jobs are not only associated with the job's position in the sequence but also associated with the machine number and the job number. All the processing time functions of jobs are not restricted to any specific form. The objective is to minimize the total load on machines. Analytical results show that all the considered multi-machine scheduling problems can be optimally solved in polynomial time. (C) 2014 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available