Robust Scheduling of Two-Agent Customer Orders with Scenario-Dependent Component Processing Times and Release Dates

Chin-Chia Wu, Jatinder N. D. Gupta, Win-Chin Lin, Shuenn-Ren Cheng, Yen-Lin Chiu, Juin-Han Chen and Long-Yuan Lee
Additional contact information
Chin-Chia Wu: Department of Statistics, Feng Chia University, Taichung 40724, Taiwan
Jatinder N. D. Gupta: College of Business, University of Alabama in Huntsville, Huntsville, AL 35899, USA
Win-Chin Lin: Department of Statistics, Feng Chia University, Taichung 40724, Taiwan
Shuenn-Ren Cheng: Department of Esports Technology Management, Cheng Shiu University, Kaohsiung 83347, Taiwan
Yen-Lin Chiu: Department of Statistics, Feng Chia University, Taichung 40724, Taiwan
Juin-Han Chen: Department of Industrial Engineering & Management, Cheng Shiu University, Kaohsiung 83347, Taiwan
Long-Yuan Lee: Department of Leisure and Sport Management, Cheng Shiu University, Kaohsiung 83347, Taiwan

Mathematics, 2022, vol. 10, issue 9, 1-17

Abstract: Although some uncertainty factors can occur in many practical environments, customer order scheduling problems involving two agents in such uncertain environments have not received attention in the current literature. Motivated by this observation, we address a two-agent customer order scheduling problem where various customer orders have scenario-dependent component processing times and release dates in order to find an appropriate schedule to minimize the maximum of the total completion time of the customer orders that belong to one agent and are subject to a constraint with the other agent. In order to solve this problem, a lower bound and six dominant properties are derived and used to propose a branch-and-bound algorithm to find an exact optimal solution. Afterward, three local search heuristics and two variants of a simulated annealing hyper-heuristic are proposed and empirically evaluated in order to find approximate solutions. Finally, we conclude the paper with a summary of our findings and some directions for future research.

Keywords: customer order scheduling; two agents; scenario-dependent component processing times; release dates; simulated annealing; hyper-heuristic (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/9/1545/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/9/1545/ (text/html)

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:gam:jmathe:v:10:y:2022:i:9:p:1545-:d:808546

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().