Resource-controlled stochastic customer order scheduling via particle swarm optimization with bound information

Purpose: Cycle time reduction is important for order fulling process but often subject to resource constraints. This study considers an unrelated parallel machine environment where orders with random demands arrive dynamically. Processing speeds are controlled by resource allocation and subject to d...

Full description

Saved in:
Bibliographic Details
Main Authors: Zhao, Yaping, Kong, Xiangtianrui, Xu, Xiaoyun, Xu, Endong
Format: text
Published: Archīum Ateneo 2022
Subjects:
Online Access:https://archium.ateneo.edu/gsb-pubs/76
https://doi.org/10.1108/IMDS-02-2022-0105
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Ateneo De Manila University
id ph-ateneo-arc.gsb-pubs-1075
record_format eprints
spelling ph-ateneo-arc.gsb-pubs-10752022-12-09T01:17:28Z Resource-controlled stochastic customer order scheduling via particle swarm optimization with bound information Zhao, Yaping Kong, Xiangtianrui Xu, Xiaoyun Xu, Endong Purpose: Cycle time reduction is important for order fulling process but often subject to resource constraints. This study considers an unrelated parallel machine environment where orders with random demands arrive dynamically. Processing speeds are controlled by resource allocation and subject to diminishing marginal returns. The objective is to minimize long-run expected order cycle time via order schedule and resource allocation decisions. Design/methodology/approach: A stochastic optimization algorithm named CAP is proposed based on particle swarm optimization framework. It takes advantage of derived bound information to improve local search efficiency. Parameter impacts including demand variance, product type number, machine speed and resource coefficient are also analyzed through theoretic studies. The algorithm is evaluated and benchmarked with four well-known algorithms via extensive numerical experiments. Findings: First, cycle time can be significantly improved when demand randomness is reduced via better forecasting. Second, achieving processing balance should be of top priority when considering resource allocation. Third, given marginal returns on resource consumption, it is advisable to allocate more resources to resource-sensitive machines. Originality/value: A novel PSO-based optimization algorithm is proposed to jointly optimize order schedule and resource allocation decisions in a dynamic environment with random demands and stochastic arrivals. A general quadratic resource consumption function is adopted to better capture diminishing marginal returns. 2022-01-01T08:00:00Z text https://archium.ateneo.edu/gsb-pubs/76 https://doi.org/10.1108/IMDS-02-2022-0105 Graduate School of Business Publications Archīum Ateneo Bound information Particle swarm optimization Resource-controlled scheduling Stochastic customer order Unrelated parallel machine Business Business Administration, Management, and Operations Technology and Innovation
institution Ateneo De Manila University
building Ateneo De Manila University Library
continent Asia
country Philippines
Philippines
content_provider Ateneo De Manila University Library
collection archium.Ateneo Institutional Repository
topic Bound information
Particle swarm optimization
Resource-controlled scheduling
Stochastic customer order
Unrelated parallel machine
Business
Business Administration, Management, and Operations
Technology and Innovation
spellingShingle Bound information
Particle swarm optimization
Resource-controlled scheduling
Stochastic customer order
Unrelated parallel machine
Business
Business Administration, Management, and Operations
Technology and Innovation
Zhao, Yaping
Kong, Xiangtianrui
Xu, Xiaoyun
Xu, Endong
Resource-controlled stochastic customer order scheduling via particle swarm optimization with bound information
description Purpose: Cycle time reduction is important for order fulling process but often subject to resource constraints. This study considers an unrelated parallel machine environment where orders with random demands arrive dynamically. Processing speeds are controlled by resource allocation and subject to diminishing marginal returns. The objective is to minimize long-run expected order cycle time via order schedule and resource allocation decisions. Design/methodology/approach: A stochastic optimization algorithm named CAP is proposed based on particle swarm optimization framework. It takes advantage of derived bound information to improve local search efficiency. Parameter impacts including demand variance, product type number, machine speed and resource coefficient are also analyzed through theoretic studies. The algorithm is evaluated and benchmarked with four well-known algorithms via extensive numerical experiments. Findings: First, cycle time can be significantly improved when demand randomness is reduced via better forecasting. Second, achieving processing balance should be of top priority when considering resource allocation. Third, given marginal returns on resource consumption, it is advisable to allocate more resources to resource-sensitive machines. Originality/value: A novel PSO-based optimization algorithm is proposed to jointly optimize order schedule and resource allocation decisions in a dynamic environment with random demands and stochastic arrivals. A general quadratic resource consumption function is adopted to better capture diminishing marginal returns.
format text
author Zhao, Yaping
Kong, Xiangtianrui
Xu, Xiaoyun
Xu, Endong
author_facet Zhao, Yaping
Kong, Xiangtianrui
Xu, Xiaoyun
Xu, Endong
author_sort Zhao, Yaping
title Resource-controlled stochastic customer order scheduling via particle swarm optimization with bound information
title_short Resource-controlled stochastic customer order scheduling via particle swarm optimization with bound information
title_full Resource-controlled stochastic customer order scheduling via particle swarm optimization with bound information
title_fullStr Resource-controlled stochastic customer order scheduling via particle swarm optimization with bound information
title_full_unstemmed Resource-controlled stochastic customer order scheduling via particle swarm optimization with bound information
title_sort resource-controlled stochastic customer order scheduling via particle swarm optimization with bound information
publisher Archīum Ateneo
publishDate 2022
url https://archium.ateneo.edu/gsb-pubs/76
https://doi.org/10.1108/IMDS-02-2022-0105
_version_ 1753806465430192128