Affiliation:
1. School of Science, Shenyang Aerospace University, Shenyang 110136, China
2. College of Mathematics and Computer, Jilin Normal University, Siping 136000, China
Abstract
This paper studies the single-machine group scheduling problem with convex resource allocation and learning effect. The number of jobs in each group is different, and the corresponding common due dates are also different, where the processing time of jobs follows a convex function of resource allocation. Under common due date assignment, the objective is to minimize the weighted sum of earliness, tardiness, common due date, resource consumption, and makespan. To solve the problem, we present the heuristic, simulated annealing, and branch-and-bound algorithms. Computational experiments indicate that the proposed algorithms are effective.
Reference43 articles.
1. Fifty years of scheduling: A survey of milestones;Potts;J. Oper. Res. Soc.,2009
2. Scheduling step-deteriorating jobs on bounded parallel-batching machines to maximise the total net revenue;Pei;J. Oper. Res. Soc.,2019
3. Lee, M., Moon, K., Lee, K., Hong, J., and Pinedo, M. (2023). A critical review of planning and scheduling in steel-making and continuous casting in the steel industry. J. Oper. Res. Soc., 1–35.
4. A survey of scheduling with controllable processing times;Shabtay;Discret. Appl. Math.,2007
5. Single machine scheduling with resource dependent release times and processing times;Wang;Eur. J. Oper.,2005
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献