Study on Convex Resource Allocation Scheduling with a Time-Dependent Learning Effect

被引:16
作者
Wang, Yi-Chun [1 ]
Wang, Ji-Bo [1 ]
机构
[1] Shenyang Aerosp Univ, Sch Sci, Shenyang 110136, Peoples R China
关键词
scheduling; branch-and-bound; resource allocation; learning effect; heuristic; FLOW TIME; MACHINE; ALGORITHM;
D O I
10.3390/math11143179
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In classical schedule problems, the actual processing time of a job is a fixed constant, but in the actual production process, the processing time of a job is affected by a variety of factors, two of which are the learning effect and resource allocation. In this paper, single-machine scheduling problems with resource allocation and a time-dependent learning effect are investigated. The actual processing time of a job depends on the sum of normal processing times of previous jobs and the allocation of non-renewable resources. With the convex resource consumption function, the goal is to determine the optimal schedule and optimal resource allocation. Three problems arising from two criteria (i.e., the total resource consumption cost and the scheduling cost) are studied. For some special cases of the problems, we prove that they can be solved in polynomial time. More generally, we propose some accurate and intelligent algorithms to solve these problems.
引用
收藏
页数:20
相关论文
共 30 条
[1]   Scheduling problems under learning effects: classification and cartography [J].
Azzouz, Ameni ;
Ennigrou, Meriem ;
Ben Said, Lamjed .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2018, 56 (04) :1642-1661
[3]   Single-machine scheduling with learning considerations [J].
Biskup, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 115 (01) :173-178
[4]   Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs [J].
Chen, Ke ;
Cheng, T. C. E. ;
Huang, Hailiang ;
Ji, Min ;
Yao, Danli .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 309 (01) :24-34
[5]   New Lagrangian relaxation based algorithm for resource scheduling with homogeneous subproblems [J].
Guan, XH ;
Zhai, QZ ;
Lai, F .
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2002, 113 (01) :65-82
[6]  
Hardy G., 1959, Inequalities
[7]   MINIMIZING VARIATION OF FLOW TIME IN SINGLE-MACHINE SYSTEMS [J].
KANET, JJ .
MANAGEMENT SCIENCE, 1981, 27 (12) :1453-1459
[8]   Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect [J].
Kuo, Wen-Hung ;
Yang, Dar-Li .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 174 (02) :1184-1190
[9]   Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights [J].
Liu, Wei-Wei ;
Jiang, Chong .
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2020, 37 (03)
[10]   Group Technology Scheduling with Due-Date Assignment and Controllable Processing Times [J].
Liu, Weiguo ;
Wang, Xuyin .
PROCESSES, 2023, 11 (04)