New model to streamline customer order scheduling
DOI:
https://doi.org/10.38152/bjtv8n1-015Keywords:
optimization, customer order scheduling, streamline COS, resource managementAbstract
The Customer Order Scheduling (COS) problem involves organizing a set of orders, each characterized by a release time, a due date, and a processing time, with the objective of minimizing the costs associated with delivery delays. This study introduces an innovative approach, the Streamline COS, which integrates order scheduling optimization with improved resource utilization and a reduction in production inefficiencies. We present a model aimed at minimizing an objective function that encompasses delay penalties and the optimization of resource usage. Additionally, we introduce an optimized COS algorithm, named SCOS (Streamline COS), designed to find the optimal solution. The efficacy of this approach is validated through experiments with several datasets of varying sizes and instances, demonstrating that the Streamline COS method significantly enhances resource management, reduces delays, and optimizes order scheduling, while offering flexible priority management. This approach provides a practical and effective solution to complex scheduling problems and opens new research avenues, particularly in integrating dynamic constraints and leveraging optimization and machine learning techniques for further performance improvements.
References
AHMADI, R.; BAGCHI, U.; ROEMER, T. Coordinated scheduling of customer orders for quick response. Naval Research Logistics, v. 52, p. 493–512, 2005.
AYTUG, H. et al. Executing production schedules in the face of uncertainties: A review and some future directions. European Journal of Operational Research, v. 161, p. 86–110, 2005.
DANIELS, R.; KOUVELIS, P. Robust scheduling to hedge against processing time uncertainty in single-stage production. Management Science, v. 41, n. 2, p. 363–376, 1995.
DAUOD, H. et al. Multi-objective optimization of the order scheduling problem in mail-order pharmacy automation systems. International Journal of Advanced Manufacturing Technology, v. 99, p. 73–83, 2018.
DE Abreu, L. R. et al. A novel brkga for the customer order scheduling with missing operations to minimize total tardiness. Swarm and Evolutionary Computation, v. 75, p. 101149, 2022.
FRAMINAN, J.; PEREZ-GONZALEZ, P. New approximate algorithms for the customer order scheduling problem with total completion time objective. Computers & Operations Research, v. 78, p. 181–192, 2017.
KOUVELIS, P.; YU, G. Robust Discrete Optimization and Its Applications. Kluwer Academic Publishers, 1997.
KUNG, J.-Y. et al. Metaheuristics for order scheduling problem with unequal ready times. Discrete Dynamics in Nature and Society, v. 2018.
LEE, I. S. Minimizing total tardiness for the order scheduling problem. International Journal of Production Economics, v. 144, n. 1, p. 128–134, 2013.
LEUNG, J.; LI, H.; PINEDO, M. Scheduling orders for multiple product types with due date related objectives. European Journal of Operational Research, v. 168, p. 370–389, 2006.
LIN, B.; KONONOV, A. Customer’s order scheduling to minimize the number of late jobs. European Journal of Operational Research, v. 183, n. 2, p. 944–948, 2007.
LIN, W.-C. et al. Particle swarm optimization and opposite-based particle swarm optimization for two-agent multi-facility customer order scheduling with ready times. Applied Soft Computing, v. 52, p. 877–884, 2017.
PRATA, B. de A.; RODRIGUES, C. D.; FRAMINAN, J. M. A differential evolution algorithm for the customer order scheduling problem with sequence-dependent setup times. Expert Systems with Applications, v. 189, p. 116097, 2022.
SABUNCUOGLU, I.; GOREN, S. Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research. International Journal of Computer Integrated Manufacturing, v. 22, n. 2, p. 138–157, 2009.
SHI, Z. et al. Minimizing completion time for order scheduling: Formulation and heuristic algorithm. IEEE Transactions on Automation Science and Engineering, v. 14, n. 4, p. 1558–1569, 2017.
SUNG, C.; YOON, S. Minimizing total weighted completion time at a
pre-assembly stage composed of two feeding machines. International Journal of Production Economics, v. 54, p. 247–255, 1998.
WANG, G.; CHENG, T. Customer order scheduling to minimize total weighted completion time. Omega, v. 35, p. 623–626, 2007.
XU, X. et al. Customer order scheduling on unrelated parallel machines to minimize total completion time. IEEE Transactions on Automation Science and Engineering, v. 12, n. 1, p. 244–257, 2015.
YANG, J.; YU, G. On the robust single machine scheduling problem. Journal of Combinatorial Optimization, v. 6, p. 17–33, 2002.
YOON, S.; SUNG, C. Fixed pre-assembly scheduling on multiple fabrication
machines. International Journal of Production Economics, v. 96, p. 109–118,
