IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v36y2019i1p40-61.html
   My bibliography  Save this article

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

Author

Listed:
  • Faizul Huq
  • M. Khurrum S. Bhutta
  • Ziaul Huq

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.

Suggested Citation

  • Faizul Huq & M. Khurrum S. Bhutta & Ziaul Huq, 2019. "A heuristic search routine for solving two objective mixed integer LP problems for scheduling in a service factory," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 36(1), pages 40-61.
    • Handle: RePEc:ids:ijores:v:36:y:2019:i:1:p:40-61
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=102069
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:36:y:2019:i:1:p:40-61. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.