Operations Research Transactions ›› 2015, Vol. 19 ›› Issue (2): 37-44.doi: 10.15960/j.cnki.issn.1007-6093.2015.02.004
Previous Articles Next Articles
JING Caixia1,*, ZHAO Congli2, YUAN Erming1
Received:
2014-12-25
Online:
2015-06-15
Published:
2015-06-15
JING Caixia, ZHAO Congli, YUAN Erming. A review of re-entrant scheduling problems[J]. Operations Research Transactions, 2015, 19(2): 37-44.
Kumar P R. Re-entrant lines [J]. Queueing Systems, 1993, 13: 87-110.
|
[1] | ZHAO Congcong, FANG Dandan, LI Rongheng. Optimal algorithms for hybrid flow shop schedule on two machines with learning effect [J]. Operations Research Transactions, 2020, 24(2): 42-60. |
[2] | ZHANG Yuzhong. A survey on job scheduling with rejection [J]. Operations Research Transactions, 2020, 24(2): 111-130. |
[3] | CHEN Rubing, YUAN Jinjiang. Single-machine scheduling to minimize total weighted late work with positional due-indices [J]. Operations Research Transactions, 2020, 24(2): 131-144. |
[4] | LIU Xiaoxia, YU Shanshan, LUO Wenchang. Approximation algorithms for single machine parallelbatch scheduling with release dates subject to the number of rejected jobs not exceeding a given threshold [J]. Operations Research Transactions, 2020, 24(1): 131-139. |
[5] | WANG Yizhan, ZHANG An, CHEN Yong, CHEN Guangting. An approximation algorithm for reclaimer scheduling [J]. Operations Research Transactions, 2020, 24(1): 147-154. |
[6] | GOU Yan, DAI Qin, ZHANG Xingong. Scheduling problem with time-and-position-dependent effect on two parallel machines environments [J]. Operations Research Transactions, 2019, 23(4): 86-94. |
[7] | LI Ganggang, LU Xiwen. An improved algorithm for single-machine scheduling problem with a period of maintenance to minimize total delivery time [J]. Operations Research Transactions, 2019, 23(4): 95-104. |
[8] | LI Wenhua, ZHAI Weina, CHAI Xing, GAO Chao. On-line bounded-batching scheduling of unit-length jobs with two families [J]. Operations Research Transactions, 2019, 23(4): 105-110. |
[9] | ZHANG Guochuan, CHEN Lin. The load balancing problem [J]. Operations Research Transactions, 2019, 23(3): 1-14. |
[10] | ZHONG Weiya, YANG Ruoyao. Scheduling with sub-jobs' due dates [J]. Operations Research Transactions, 2019, 23(2): 67-74. |
[11] | CHEN Qiuhong, ZHANG Xingong. Two-agent preemptive scheduling of jobs with fixed time windows problem about total tardiness on a single machine [J]. Operations Research Transactions, 2019, 23(1): 61-71. |
[12] | PENG Nannan, ZHANG Yuzhong, BAI Qingguo, WANG Chengfei. Online batch scheduling problem on uniform machines with agreeable processing times [J]. Operations Research Transactions, 2019, 23(1): 111-118. |
[13] |
CAI Shuang, YANG Ke, LIU Ke.
Model and algorithms of the distributed permutation flow shop scheduling problem with machine eligibility constraints
[J]. Operations Research Transactions, 2018, 22(4): 17-30.
|
[14] | ZHAO Xiaocheng, LI Dagang. Parallel machine scheduling with machine and human eligibility restrictions [J]. Operations Research Transactions, 2018, 22(3): 99-108. |
[15] | LI Ying, QIAO Longliang, ZHENG Feifeng. A study of online berth and quay crane integrated allocation problem with lookahead ability [J]. Operations Research Transactions, 2018, 22(3): 28-36. |
Viewed | ||||||
Full text |
|
|||||
Abstract |
|
|||||