Multi-objective multi-factory scheduling
RAIRO. Operations Research, Tome 55 (2021), pp. S1447-S1467

This paper introduces a multi-factory scheduling problem with heterogeneous factories and parallel machines. This problem, as a major part of supply chain planning, includes the finding of a suitable factory for each job and the scheduling of the assigned jobs at each factory, simultaneously. For the first time, this paper studies multi-objective scheduling in the production network in which each factory has its customers and demands can be satisfied by itself or other factories. In other words, this paper assumes that jobs can transfer from the overloaded machine in the origin factory to the factory, which has fewer workloads by imposing some transportation times. For simultaneous minimization of the sum of the earliness and tardiness of jobs and total completion time, after modeling the scheduling problem as a mixed-integer linear program, the existing multi-objective techniques are analyzed and a new one is applied to our problem. Since this problem is NP-hard, a heuristic algorithm is also proposed to generate a set of Pareto optimal solutions. Also, the algorithms are proposed to improve and cover the Pareto front. Computational experiences of the heuristic algorithm and the output of the model implemented by CPLEX over a set of randomly generated test problems are reported.

DOI : 10.1051/ro/2020044
Classification : 90B35, 68M14, 90C29, 90C59
Keywords: Scheduling, distributed system, multi-objective optimization, heuristic, elastic constraints method, Pareto front improving 
@article{RO_2021__55_S1_S1447_0,
     author = {Behnamian, Javad and Fatemi Ghomi, Seyyed Mohammad Taghi},
     title = {Multi-objective multi-factory scheduling},
     journal = {RAIRO. Operations Research},
     pages = {S1447--S1467},
     year = {2021},
     publisher = {EDP-Sciences},
     volume = {55},
     doi = {10.1051/ro/2020044},
     mrnumber = {4223098},
     zbl = {1469.90075},
     language = {en},
     url = {https://www.numdam.org/articles/10.1051/ro/2020044/}
}
TY  - JOUR
AU  - Behnamian, Javad
AU  - Fatemi Ghomi, Seyyed Mohammad Taghi
TI  - Multi-objective multi-factory scheduling
JO  - RAIRO. Operations Research
PY  - 2021
SP  - S1447
EP  - S1467
VL  - 55
PB  - EDP-Sciences
UR  - https://www.numdam.org/articles/10.1051/ro/2020044/
DO  - 10.1051/ro/2020044
LA  - en
ID  - RO_2021__55_S1_S1447_0
ER  - 
%0 Journal Article
%A Behnamian, Javad
%A Fatemi Ghomi, Seyyed Mohammad Taghi
%T Multi-objective multi-factory scheduling
%J RAIRO. Operations Research
%D 2021
%P S1447-S1467
%V 55
%I EDP-Sciences
%U https://www.numdam.org/articles/10.1051/ro/2020044/
%R 10.1051/ro/2020044
%G en
%F RO_2021__55_S1_S1447_0
Behnamian, Javad; Fatemi Ghomi, Seyyed Mohammad Taghi. Multi-objective multi-factory scheduling. RAIRO. Operations Research, Tome 55 (2021), pp. S1447-S1467. doi: 10.1051/ro/2020044

A. Alarcon-Rodriguez, G. Ault and S. Galloway, Multi-objective planning of distributed energy resources: a review of the state-of-the-art. Renewable Sustainable Energy Rev. 14 (2010) 1353–1366. | DOI

J. C. Beck and P. Refalo, A hybrid approach to scheduling with earliness and tardiness costs. Ann. Oper. Res. 118 (2003) 49–71. | MR | Zbl | DOI

J. Behnamian and S. M. T. Fatemi Ghomi, The heterogeneous multi-factory production network scheduling with adaptive communication policy and parallel machines. Inf. Sci. 219 (2013) 181–196. | MR | Zbl | DOI

J. Behnamian, S. M. T. Fatemi Ghomi and M. Zandieh, A multi-phase covering Pareto-optimal front method to multi-objective scheduling in a realistic hybrid flowshop using a hybrid metaheuristic. Expert Syst. App. 36 (2009) 11057–11069. | DOI

T. E. Carroll and D. Grosu, Selfish multi-user task scheduling. In: The Fifth International Symposium on Parallel and Distributed Computing (ISPDC ‘06), Timisoara (2006) 99–106. | DOI

H. C. Chang and T. K. Liu, Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms. J. Intell. Manuf. 28 (2017) 1973–1986. | DOI

V. A. Cicirello and S. F. Smith, Wasp-like agents for distributed factory coordination. Auton. Agents Multi-Agent Syst. 8 (2004) 237–266. | DOI

K. Deb, Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley and Sons, Delhi (2010). | Zbl | MR

M. M. Dessouky, Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness. Comput. Ind. Eng. 34 (1998) 793–806. | DOI

G. Feng and H. C. Lau, Efficient algorithms for machine scheduling problems with earliness and tardiness penalties. Ann. Oper. Res. 159 (2008) 83–95. | MR | Zbl | DOI

M. Gendreau and J.-Y. Potvin, editors. Handbook of Metaheuristics, 2nd edition. Vol. 272 of International Series in Operations Research & Management Science. Springer, New York, NY (2010). | Zbl

M. G. Gnoni, R. Iavagnilio, G. Mossa, G. Mummolo and A. Di Leva, Production planning of a multi-site manufacturing system by hybrid modelling: a case study from the automotive industry. Int. J. Prod. Econ. 85 (2003) 251–262. | DOI

J. Grobler, A. P. Engelbrecht, S. Kok and S. Yadavalli, Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time. Ann. Oper. Res. 180 (2010) 165–196. | Zbl | DOI

Ö. Hazır and S. Kedad-Sidhoum, Batch sizing and just-in-time scheduling with common due date. Ann. Oper. Res. 213 (2014) 187–202. | MR | Zbl | DOI

T. İnkaya and M. Akansel, Coordinated scheduling of the transfer lots in an assembly-type supply chain: a genetic algorithm approach. J. Intell. Manuf. 28 (2017) 1005–1015. | DOI

S. C. H Leung, Y. Wu and K. K. Lai, Multi-site aggregate production planning with multiple objectives: a goal programming approach. Prod. Planning Control 14 (2003) 425–436. | DOI

J. Lin, Z. J. Wang and X. Li, A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem. Swarm Evol. Comput. 36 (2017) 124–135. | DOI

T. Meng, Q.-K. Pan and L. Wang, A distributed permutation flowshop scheduling problem with the customer order constraint. Knowl. Based Syst. 184 (2019) 104894. | DOI

M. Ramanauskas, D. Šešok, R. Belevičius, E. Kurilovas and S. Valentinavičius, Genetic algorithm with modified crossover for grillage optimization. Int. J. Comput. Commun. Control 12 (2017) 393–403. | DOI

R. Ruiz and T. Stuetzle, An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur. J. Oper. Res. 187 (2008) 1143–1159. | Zbl | DOI

M. Sambasivan and S. Yahya, A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers. Comput. Oper. Res. 32 (2005) 537–555. | Zbl | DOI

W. Shao, D. Pi and Z. Shao, Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms. Knowl. Based Syst. 137 (2017) 163–181. | DOI

S. Terrazas-Moreno and I. E. Grossmann, A multiscale decomposition method for the optimal planning and scheduling of multi-site continuous multiproduct plants. Chem. Eng. Sci. 66 (2011) 4307–4318. | DOI

C. H. Timpe and J. Kallrath, Optimal planning in large multi-site production networks. Eur. J. Oper. Res. 126 (2000) 422–435. | MR | Zbl | DOI

F. M. Westfield, Marginal analysis, multi-plant firms, and business practice: an example. Q. J. Econ. 69 (1955) 253–268. | DOI

J. F. H Williams, Heuristic techniques for simultaneous scheduling of production and distribution in multi-echelon structures: theory and empirical comparisons. Manage. Sci. 27 (1981) 336–352. | Zbl | DOI

X. Wu, X. Liu and N. Zhao, An improved differential evolution algorithm for solving a distributed assembly flexible job shop scheduling problem. Memet. Comput. 11 (2019) 335–355. | DOI

G. Zhang and K. Xing, Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion. Comput. Oper. Res. 108 (2019) 33–43. | MR | Zbl | DOI

Cité par Sources :