An Order Scheduling Heuristic to Minimize the Total Collation Delays and the Makespan in High-Throughput Make-to-Order Manufacturing Systems

Husam Dauod, Nieqing Cao, Debiao Li, Jaehee Kim, Sang Won Yoon and Daehan Won ()
Additional contact information
Husam Dauod: State University of New York at Binghamton
Nieqing Cao: State University of New York at Binghamton
Debiao Li: Fuzhou University
Jaehee Kim: Jeonbuk National University
Sang Won Yoon: State University of New York at Binghamton
Daehan Won: State University of New York at Binghamton

SN Operations Research Forum, 2023, vol. 4, issue 2, 1-23

Abstract: Abstract This paper presents an order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems. Order collation delay is the completion time difference between the first and the last processed items within the same order. Large order collation delays contribute to a reduced throughput, non-recoverable productivity loss, or even system deadlocks. In manufacturing systems with high throughput, this scheduling problem becomes computationally expensive to solve because the number of orders is very large; thus, efficient constructive algorithms are needed. To minimize both objectives efficiently, this paper proposes a novel workload balance with single-item orders (WBSO) heuristic while considering machine flexibility. Through a comparison with (1) the non-dominated sorting genetic algorithm II (NSGA-II), (2) priority-based longest processing rule (LPT-P), (3) priority-based least total workload rule (LTW-P), and (4) multi-item orders first rule (MIOF), the effectiveness of the proposed method is evaluated. Experimental results for different scenarios indicate that the proposed WBSO heuristic provides 33% fewer collation delays and 6% more makespan on average when compared to the NSGA-II. The proposed method can work on both small and large problem sizes, and the results also show that for large size problems, the WBSO generates 74%, 89%, and 62% fewer collation delays on average than LPT-P, LTW-P, and MIOF rules respectively.

Keywords: Order scheduling; Make to order production; Parallel machines; Order collation delays (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s43069-023-00227-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:snopef:v:4:y:2023:i:2:d:10.1007_s43069-023-00227-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/43069

DOI: 10.1007/s43069-023-00227-2

Access Statistics for this article

SN Operations Research Forum is currently edited by Marco Lübbecke

More articles in SN Operations Research Forum from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().