Volume 57, Number 3, May-June 2023
|Page(s)||1179 - 1193|
|Published online||18 May 2023|
A new and general stochastic parallel machine ScheLoc problem with limited location capacity and customer credit risk
School of Economics & Management, Tongji University, Shanghai, P.R. China
2 School of Economics & Management, Fuzhou University, Fujian, P.R. China
3 Glorious Sun School of Business & Management, Donghua University, Shanghai, P.R. China
4 Université Gustave-Eiffel, ESIEE Paris, COSYS-GRETTIA, F-77454 Marne-la-Vallée, France
* Corresponding author: firstname.lastname@example.org
Accepted: 10 February 2023
Scheduling-Location (ScheLoc) problem considering machine location and job scheduling simultaneously is a relatively new and hot topic. The existing works assume that only one machine can be placed at a location, which may not be suitable for some practical applications. Besides, the customer credit risk which largely impacts the manufacturer’s profit has not been addressed in the ScheLoc problem. Therefore, in this work, we study a new and general stochastic parallel machine ScheLoc problem with limited location capacity and customer credit risk. The problem consists of determining the machine-to-location assignment, job acceptance, job-to-machine assignment, and scheduling of accepted jobs on each machine. The objective is to maximize the worst-case probability of manufacturer’s profit being greater than or equal to a given profit (referred to as the profit likelihood). For the problem, a distributionally robust chance-constrained (DRCC) programming model is proposed. Then, we develop two model-based approaches: (1) a sample average approximation (SAA) method; (2) a model-based constructive heuristic. Numerical results of 300 instances adapted from the literature show the average profit likelihood proposed by the constructive heuristic is 9.43% higher than that provided by the SAA, while the average computation time of the constructive heuristic is only 4.24% of that needed by the SAA.
Mathematics Subject Classification: 90
Key words: parallel machine ScheLoc problem / limited location capacity / customer credit risk / distributionally robust optimization
© The authors. Published by EDP Sciences, ROADEF, SMAI 2023
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.