Title: A heuristic search routine for solving two objective mixed integer LP problems for scheduling in a service factory
Authors: Faizul Huq; M. Khurrum S. Bhutta; Ziaul Huq
Addresses: Management Department, College of Business, Ohio University, Copeland Hall, Athens, OH 45701, USA ' Management Department, College of Business, Ohio University, Copeland Hall, Athens, OH 45701, USA ' Management Department, College of Business Administration, University of Nebraska at Omaha, Omaha, NE, USA
Abstract: This paper presents a two-objective mixed binary integer linear programming model and a search routine solution method is proposed using a service factory environment with multi-processor workstations and a constant daily workload, for employee scheduling, number of machines per station, and makespan minimisation objectives. The search routine is simple enough to be implemented by managers using readily available spreadsheet programs. Solution of the four-station service factory formulation yielded results for improvement in the makespan of the shop. This search routine can be used by management in streamlining and optimising the service factory production environment as exemplified in the four-station case, and could also be applied to multi-processor flow shops.
Keywords: service factory; scheduling; lot splitting; binary integer linear programming; makespan.
International Journal of Operational Research, 2019 Vol.36 No.1, pp.40 - 61
Available online: 04 Sep 2019 *Full-text access for editors Access for subscribers Purchase this article Comment on this article