论文信息 - Semi-on-line problems on two identical machines with combined partial information

Semi-on-line problems on two identical machines with combined partial information

This paper considers the semi-on-line versions of scheduling problem P2||C"m"a"x. We study the semi-on-line problems with combination of two types of information. Five basic types of partial information are considered. For two kinds of pairwise combination, we present their respective optimal semi-on-line algorithms which show that combination can admit to construct better algorithms.

Yong He | Zhiyi Tan | Z. Tan | Yong He

[1] Zsolt Tuza,et al. Semi on-line algorithms for the partition problem , 1997, Oper. Res. Lett..

[2] Yong He. The optimal on-line parallel machine scheduling , 2000 .

[3] Yong He,et al. Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times , 2002 .

[4] Gerhard J. Woeginger,et al. A Review of Machine Scheduling: Complexity, Algorithms and Approximability , 1998 .

[5] Guochuan Zhang,et al. Semi On-Line Scheduling on Two Identical Machines , 1999, Computing.

[6] Yong He,et al. Semi-on-line scheduling with ordinal data on two uniform machines , 2001, Oper. Res. Lett..

[7] Guochuan Zhang,et al. A note on on-line scheduling with partial information , 2002 .

[8] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.

[9] Yong He,et al. Ordinal On-Line Scheduling for Maximizing the Minimum Machine Completion Time , 2002, J. Comb. Optim..

[10] P. Pardalos,et al. Handbook of Combinatorial Optimization , 1998 .

[11] Gerhard J. Woeginger,et al. Semi-online scheduling with decreasing job sizes , 2000, Oper. Res. Lett..

[12] Jeffrey B. Sidney,et al. Ordinal algorithms for parallel machine scheduling , 1996, Oper. Res. Lett..

[13] Yossi Azar,et al. On-Line Bin-Stretching , 1998, RANDOM.