Title: Heuristics for the integrated single machine scheduling and location problem

Authors: S. Akbarinasaji; A. McKendall

Addresses: Data Science Lab, Ryerson University, 350 Victoria Street, Toronto, ON M5B 2K3, Canada ' Department of Industrial and Management Systems Engineering, West Virginia University, 325A Mineral Resources Building, Morgantown, WV 26506, USA

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.

Keywords: single machine scheduling; single machine location; mathematical models; heuristics; makespan.

DOI: 10.1504/IJISE.2017.086278

International Journal of Industrial and Systems Engineering, 2017 Vol.27 No.2, pp.196 - 209

Received: 18 May 2015
Accepted: 03 Oct 2015

Published online: 04 Sep 2017 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article