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

Haidong Li, Zhen Li, Yaping Zhao and Xiaoyun Xu

Journal of the Operational Research Society, 2021, vol. 72, issue 8, 1726-1736

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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/01605682.2020.1718010 (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:taf:tjorxx:v:72:y:2021:i:8:p:1726-1736

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/tjor20

DOI: 10.1080/01605682.2020.1718010

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald

More articles in Journal of the Operational Research Society from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().