工件允许拆分加工的单机排序问题

申惠军, 耿志超

doi:10.13371/j.cnki.chin.q.j.m.2022.04.009

数学季刊 >

2022 , Vol. 37 >Issue 4: 412 - 421

DOI: https://doi.org/10.13371/j.cnki.chin.q.j.m.2022.04.009

工件允许拆分加工的单机排序问题

展开

School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, China

SHEN Hui-jun (2000-), male, native of Zhengzhou, Henan, postgraduate of Zhengzhou University, engages in scheduling and combinatorial optimization; GENG Zhi-chao (1981-), male, native of Zhengzhou, Henan, lecturer of Zhengzhou University, engages in scheduling and combinatorial optimization.

收稿日期: 2022-11-14

网络出版日期: 2022-12-30

基金资助

Supported by National Natural Science Foundation of China (Grant Nos. 12071442, 11971443, 12271491).

收起

A Note on Single-Machine Lot Scheduling with Splittable Jobs to Minimize the Number of Tardy Jobs

Expand

School of Mathematics and Statistics, Zhengzhou University, Zhengzhou 450001, China

Received date: 2022-11-14

Online published: 2022-12-30

Supported by

Supported by National Natural Science Foundation of China (Grant Nos. 12071442, 11971443, 12271491).

Fold

摘要

The single-machine lot scheduling problem with splittable jobs to minimize the number of tardy jobs has been showed to be weakly NP-hard in the literature. In this paper, we show that a generalized version of this problem in which jobs have deadlines is strongly NP-hard, and also present the results of some related scheduling problems.

关键词： Lot scheduling; The number of tardy jobs; Splitting jobs; Strongly NP-hard

本文引用格式

申惠军, 耿志超 . 工件允许拆分加工的单机排序问题[J]. 数学季刊, 2022 , 37(4) : 412 -421 . DOI: 10.13371/j.cnki.chin.q.j.m.2022.04.009

Abstract

Key words： Lot scheduling; The number of tardy jobs; Splitting jobs; Strongly NP-hard

Options

文章导航

模态框（Modal）标题

摘要

本文引用格式

Abstract