Heuristics for the integrated single machine scheduling and location problem Online publication date: Mon, 04-Sep-2017
by S. Akbarinasaji; A. McKendall
International Journal of Industrial and Systems Engineering (IJISE), Vol. 27, No. 2, 2017
Abstract: In this paper, the simultaneous single machine scheduling and location (ScheLoc) problem is considered. More specifically, the ScheLoc problem is the problem of locating a single machine on the plant floor while scheduling jobs on the machine. Many of the methods presented in the literature for this problem are very powerful exact methods, requiring not only substantial knowledge of location theory but also knowledge of how to use these powerful, yet complex, exact methods. Therefore, the main objective of this paper is to present simple mathematical models and heuristics for practitioners to easily solve real-world problems. Heuristics as well as mathematical programming models are presented for the ScheLoc problem. Randomly generated problems are solved using the proposed solution methods, and the results indicate the effectiveness of the proposed methods.
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 Industrial and Systems Engineering (IJISE):
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