Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption

被引：38

作者：

Yuan, Jinjiang ^{[1
]}

Mu, Yundong

机构：

[1] Zhengzhou Univ, Dept Math, Zhengzhou 450052, Henan, Peoples R China

[2] Henan Univ Technol, Dept Math & Phys, Zhengzhou 450052, Henan, Peoples R China

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2007年 / 182卷 / 02期

基金：

中国国家自然科学基金;

关键词：

rescheduling; makespan; single machine; release dates; disruption; NP-hard;

D O I：

10.1016/j.ejor.2006.07.026

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

In this paper, we consider the rescheduling problem for jobs on a single machine with release dates to minimize makespan under a limit on the maximum sequence disruption. We show that the considered problem can be solved in polynomial time. (C) 2006 Elsevier B.V. All rights reserved.

引用

页码：936 / 944

页数：9

共 50 条

[21] Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
Miao, Cuixia
Zhang, Yuzhong
Wu, Cuilian
[J]. THEORETICAL COMPUTER SCIENCE, 2012, 462 : 80 - 87
[22] Two-agent single-machine scheduling with release dates to minimize the makespan
Jin Yu
Peihai Liu
Xiwen Lu
[J]. Optimization Letters, 2023, 17 : 1915 - 1937
[23] Two-agent single-machine scheduling with release dates to minimize the makespan
Yu, Jin
Liu, Peihai
Lu, Xiwen
[J]. OPTIMIZATION LETTERS, 2023, 17 (08) : 1915 - 1937
[24] A PTAS for single-machine scheduling with release dates and job delivery to minimize makespan
Lu, Lingfa
Zhang, Liqi
[J]. RAIRO-OPERATIONS RESEARCH, 2019, 53 (04) : 1261 - 1266
[25] Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan
Lancia, G
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 120 (02) : 277 - 288
[26] OPEN-SHOP SCHEDULING WITH RELEASE DATES TO MINIMIZE MAXIMUM LATENESS
KELLERER, H
TAUTENHAHN, T
WOEGINGER, G
[J]. NAVAL RESEARCH LOGISTICS, 1995, 42 (01) : 141 - 145
[27] Single machine batch scheduling problem with family setup times and release dates to minimize makespan
Yuan, J. J.
Liu, Z. H.
Ng, C. T.
Cheng, T. C. E.
[J]. JOURNAL OF SCHEDULING, 2006, 9 (06) : 499 - 513
[28] Single machine batch scheduling problem with family setup times and release dates to minimize makespan
J. J. Yuan
Z. H. Liu
C. T. Ng
T. C. E. Cheng
[J]. Journal of Scheduling, 2006, 9 : 499 - 513
[29] Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness
B. Naderi
M. Zandieh
V. Roshanaei
[J]. The International Journal of Advanced Manufacturing Technology, 2009, 41 : 1186 - 1198
[30] Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness
Naderi, B.
Zandieh, M.
Roshanaei, V.
[J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2009, 41 (11-12): : 1186 - 1198

← 1 2 3 4 5 →