Scheduling programs on a multiprocessing computer system to minimize the maximum processing time

被引：0

|

作者：

Buchalski, Zbigniew

机构：

来源：

| 2000年 / Wroclaw, Poland卷

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：217 / 223

相关论文

共 50 条

[41] Online scheduling in a parallel batch processing system to minimize makespan using restarts
Fu, Ruyan
Tian, Ji
Yuan, Jinjiang
Lin, Yixun
THEORETICAL COMPUTER SCIENCE, 2007, 374 (1-3) : 196 - 202
[42] Two-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times
Allahverdi, Ali
KUWAIT JOURNAL OF SCIENCE & ENGINEERING, 2006, 33 (02): : 233 - 252
[43] A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
Yuan, JJ
Yang, AF
Cheng, TCE
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 158 (02) : 525 - 528
[44] Heuristics for the two-machine flowshop scheduling problem to minimize maximum lateness with bounded processing times
Allahverdi, Ali
Aydilek, Harun
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2010, 60 (05) : 1374 - 1384
[45] On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
Ng, C. T.
Lu, Lingfa
JOURNAL OF SCHEDULING, 2012, 15 (03) : 391 - 398
[46] On-line integrated production and outbound distribution scheduling to minimize the maximum delivery completion time
C. T. Ng
Lingfa Lu
Journal of Scheduling, 2012, 15 : 391 - 398
[47] Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
Azizoglu, M
Koksalan, M
Koksalan, SK
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2003, 54 (06) : 661 - 664
[48] Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
Azizoglu, M
Köksalan, M
Kondak, S
RESEARCH AND PRACTICE IN MULTIPLE CRITERIA DECISION MAKING, 2000, 487 : 381 - 387
[49] Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time
Li, Wenhua
Yuan, Jinjiang
INFORMATION PROCESSING LETTERS, 2011, 111 (18) : 907 - 911
[50] Expected deadlock time in a multiprocessing system
Univ of Michigan, Ann Arbor, United States
J Assoc Comput Mach, 3 (562-583):

← 1 2 3 4 5 →