IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v72y2021i8p1726-1736.html
   My bibliography  Save this article

Scheduling customer orders on unrelated parallel machines to minimise total weighted completion time

Author

Listed:
  • Haidong Li
  • Zhen Li
  • Yaping Zhao
  • Xiaoyun Xu

Abstract

This paper addresses the scheduling problem for customer orders on a set of unrelated parallel machines. Each order consists of multiple product types with various workloads that can be assigned to and processed by the machines. The objective is to minimise the total weighted completion time of all customer orders. Several optimality properties are developed, and an easily computable lower bound is established. Besides, for two important special cases, the corresponding optimal schedules are further provided. Inspired by these results, three heuristic algorithms are proposed, and their worst case performances are proved to be bounded. The effectiveness of the lower bound and the proposed algorithms are demonstrated through numerical experiments. This study brings new perspectives to the management of differentiated customers in complicated production environment.

Suggested Citation

  • Haidong Li & Zhen Li & Yaping Zhao & Xiaoyun Xu, 2021. "Scheduling customer orders on unrelated parallel machines to minimise total weighted completion time," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 72(8), pages 1726-1736, August.
    • Handle: RePEc:taf:tjorxx:v:72:y:2021:i:8:p:1726-1736
    DOI: 10.1080/01605682.2020.1718010
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/01605682.2020.1718010
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/01605682.2020.1718010?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    More about this item

    Statistics

    Access and download statistics

    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:taf:tjorxx:v:72:y:2021:i:8:p:1726-1736. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.