A heuristic search routine for solving two objective mixed integer LP problems for scheduling in a service factory

Faizul Huq, M. Khurrum S. Bhutta and Ziaul Huq

International Journal of Operational Research, 2019, vol. 36, issue 1, 40-61

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. (search for similar items in EconPapers)
Date: 2019
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=102069 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:36:y:2019:i:1:p:40-61

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().