An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems

DOI10.1007/s43069-023-00227-2MaRDI QIDQ6168349

Nieqing Cao, Sang Won Yoon, Jae-Hee Kim, Dae Han Won, Husam Dauod, De Biao Li

Publication date: 8 August 2023

Published in: SN Operations Research Forum (Search for Journal in Brave)

zbMATH Keywords

parallel machinesorder schedulingmake to order productionorder collation delays

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms
• Scheduling orders for multiple product types to minimize total weighted completion time
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
• New approximate algorithms for the customer order scheduling problem with total completion time objective
• The complexity of customer order scheduling problems on parallel machines
• Customer order scheduling to minimize the number of late jobs
• Optimization Concepts and Applications in Engineering

This page was built for publication: An order scheduling heuristic to minimize the total collation delays and the makespan in high-throughput make-to-order manufacturing systems