Single-machine group scheduling with general linear deterioration and truncated learning effects

IF 2.6 3区数学

Computational and Applied Mathematics Pub Date : 2024-08-29 DOI:10.1007/s40314-024-02881-6

Na Yin, Ming Gao

引用次数: 0

Abstract

In this paper we consider single-machine scheduling problems with group technology, where the group setup times are general linear functions of their starting times and the jobs in the same group have general truncated learning effects. The objective is to minimize the makespan and total completion time, respectively. We show that the makespan minimization remains polynomially solvable. For the total completion time minimization, optimal properties are presented and then we introduce some heuristic algorithms and a branch-and-bound algorithm.

查看原文本刊更多论文

具有一般线性劣化和截断学习效应的单机组调度

在本文中，我们考虑的是采用组技术的单机调度问题，其中组的设置时间是其开始时间的一般线性函数，而同组中的作业具有一般的截断学习效应。问题的目标分别是最大限度地缩短工期和总完成时间。我们的研究表明，工期最小化仍然是多项式可解的。对于总完成时间最小化，我们提出了最优属性，然后介绍了一些启发式算法和一种分支约束算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Computational and Applied Mathematics MATHEMATICS, APPLIED-

自引率

11.50%

发文量

352

期刊介绍： Computational & Applied Mathematics began to be published in 1981. This journal was conceived as the main scientific publication of SBMAC (Brazilian Society of Computational and Applied Mathematics). The objective of the journal is the publication of original research in Applied and Computational Mathematics, with interfaces in Physics, Engineering, Chemistry, Biology, Operations Research, Statistics, Social Sciences and Economy. The journal has the usual quality standards of scientific international journals and we aim high level of contributions in terms of originality, depth and relevance.