Scenario-based heuristic to two-stage stochastic program for the parallel machine ScheLoc problem

Ming Liu (1) , Xin Liu (1) , E. Zhang (2) , Feng Chu (3, 4) , Chengbin Chu (5, 1)

1 School of Economics & Management
2 School of Information Management and Engineering
3 IBISC - Informatique, BioInformatique, Systèmes Complexes
4 Management Engineering Research Center
5 LGI - Laboratoire Génie Industriel - EA 2606

Scheduling-Location (ScheLoc) problem is a new and interesting topic in manufacturing, considering location and scheduling decisions simultaneously. Most existing works focus on the deterministic problems. In practice, however, job-processing times are usually uncertain due to some factors. This paper investigates the stochastic parallel machine ScheLoc problem to minimise the weighted sum of the location cost and the expectation of the total completion time. A two-stage stochastic programming formulation is proposed, then the sample average approximation (SAA) method is adapted to solve the small-size problems. To efficiently address the large-scale problems, a genetic algorithm (GA) and a scenario-based heuristic are designed. Numerical experiments on 450 instances are conducted. Computational results show that the scenario-based heuristic outperforms SAA method and GA in terms of solution quality and computational time.

Keywords: Two-stage stochastic integer program; Uncertain processing times; Scenario-based heuristic; ScheLoc problem

Domains: Operations Research [math.OC]

Ming Liu, Xin Liu, E. Zhang, Feng Chu, Chengbin Chu. Scenario-based heuristic to two-stage stochastic program for the parallel machine ScheLoc problem. International Journal of Production Research, 2019, 57 (6), pp.1706--1723. ⟨10.1080/00207543.2018.1504247⟩. ⟨hal-01927546⟩