|
|
Scheduling of periodic services to customers in dispersed locations from heterogeneous multi-agent companies considering uncertainty: A real case study
|
|
|
|
|
نویسنده
|
jafar-zanjani h. ,zandieh m. ,khalilzadeh m.
|
منبع
|
scientia iranica - 2021 - دوره : 28 - شماره : 4-e - صفحه:2419 -2438
|
چکیده
|
This study investigates the problem of scheduling periodic services from service providers to customers located in dierent places that need dierent services. the service centers are also located in dierent positions, each of which has a limited number of teams with the capability of performing one or some services. the goal is to simultaneously minimize 'total service costs' and 'total earliness/tardiness' in providing services for customers. providing an optimal maintenance schedule is a signicant challenge for those companies with dispersed supply centers. in this paper, a novel bi-objective mixed integer linear programming model along with augmented epsilon constraint method is presented to exactly solve this problem. then, a bi-objective meta-heuristic technique based on genetic algorithm is proposed and its performance in solving large-scale problems is assessed. companies may face uncertain parameters when using the robust possibilistic programming approach to diminish the risk of decision-making. finally, the performance of the proposed model and solution approaches is evaluated in the context of a real case study in maintenance scheduling of compressed natural gas (cng) stations equipment in iran.
|
کلیدواژه
|
Scheduling; Bi-objective optimization; Robust possibilistic programming; Genetic algorithm; Uncertainty; Augmented epsilon constraint.
|
آدرس
|
islamic azad university, science and research branch, department of industrial engineering, Iran, shahid beheshti university, management and accounting faculty, department of industrial management and information technology, Iran, islamic azad university,science and research branch, department of industrial engineering, Iran
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|