Solving Logistics Scheduling Problems Using an Extended Many-Project Optimization Model

被引:0
|
作者
Mihaly, Krisztian [1 ]
Forrai, Monika Kulcsarne [1 ]
Kulcsar, Gyula [1 ]
机构
[1] Univ Miskolc, Dept Informat Engn, Miskolc, Hungary
来源
ADVANCES IN DIGITAL LOGISTICS, LOGISTICS AND SUSTAINABILITY, CECOL 2024 | 2024年
关键词
scheduling; resource-constrained; multi-project; many-objective; hybrid solver; HYBRID METAHEURISTICS; ALGORITHM; CLASSIFICATION; EXTENSIONS; VARIANTS; SEARCH;
D O I
10.1007/978-3-031-70977-7_8
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
Logistics processes play an important role in the operation of production and service systems. The limited available resources of the systems are decisive from the point of view of efficient work. In today's globalized market environment, customer and client expectations are of prime importance. In order to fulfil their requirements, it is advisable to optimize the operation of the systems as much as possible. One of the suitable tools for this reason is the scheduling of activities. In our paper, we present an extended multi-project, multi-objective scheduling model that is suitable for the effective solution of scheduling problems in logistics systems. In the proposed model, logistics tasks appear as projects and the necessary resources are organized into types. Projects can have their own defined objective function system. The scheduler handles a set of projects that can include dependencies of projects. The objective function systems can involve different compositions and their importance can be specified individually. The limits of the resources can be given by an arbitrary discrete time function. The solution to the addressed scheduling problem is provided by a hybrid evolutionary search method using constructive heuristic algorithms. The quality of the solutions is determined using a multi-objective relative evaluation model. The paper demonstrates the applicability of the model through an illustrative example.
引用
收藏
页码:115 / 144
页数:30
相关论文
共 50 条
  • [41] A model for solving vehicle scheduling problems: a case study
    Gulnara Baldoquin, Maria
    Jose Rengifo-Campo, Alvaro
    REVISTA FACULTAD DE INGENIERIA-UNIVERSIDAD DE ANTIOQUIA, 2018, (88): : 16 - 25
  • [42] Application of GA optimization for solving precedent relationship problem in project scheduling
    Fung, Ivan W. H.
    Huang, C.
    Tam, C. M.
    MATHEMATICAL AND COMPUTER MODELLING, 2013, 57 (9-10) : 2067 - 2081
  • [43] Solving the resource constrained project scheduling problem with optimization subroutine library
    Icmeli, O
    Rom, WO
    COMPUTERS & OPERATIONS RESEARCH, 1996, 23 (08) : 801 - 817
  • [44] INTEGRATED OPTIMIZATION MODEL FOR PRODUCTION PLANNING AND SCHEDULING WITH LOGISTICS CONSTRAINTS
    Chen, Y. X.
    INTERNATIONAL JOURNAL OF SIMULATION MODELLING, 2016, 15 (04) : 711 - 720
  • [45] A batch scheduling model and algorithm of many orders for third party logistics enterprises
    Hou, JR
    Huang, PQ
    Zhao, XF
    Wang, XS
    SERVICE SYSTEMS AND SERVICE MANAGEMENT - PROCEEDINGS OF ICSSSM '04, VOLS 1 AND 2, 2004, : 535 - 538
  • [46] Solving RFID Networks Scheduling Problems Using Hybird Binary Particle Swarm Optimization Algorithm
    Tang, Jun
    APPLIED MECHANICS AND MECHANICAL ENGINEERING, PTS 1-3, 2010, 29-32 : 966 - 972
  • [47] A new evolutionary algorithm for solving many-objective optimization problems
    Zou, Xiufen
    Chen, Yu
    Liu, Minzhong
    Kang, Lishan
    IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2008, 38 (05): : 1402 - 1412
  • [48] Tropical optimization problems in time-constrained project scheduling
    Krivulin, N.
    OPTIMIZATION, 2017, 66 (02) : 205 - 224
  • [49] Tropical optimization problems with application to project scheduling with minimum makespan
    Nikolai Krivulin
    Annals of Operations Research, 2017, 256 : 75 - 92
  • [50] Tropical optimization problems with application to project scheduling with minimum makespan
    Krivulin, Nikolai
    ANNALS OF OPERATIONS RESEARCH, 2017, 256 (01) : 75 - 92