Ordinal algorithms for packing with target center of gravity-Reference-Cited by-同舟云学术

Ordinal algorithms for packing with target center of gravity

Published:1996 Issue:1 Volume:13 Page:17-31
ISSN:0167-8094
Container-title:Order
language:en
Short-container-title:Order

Author:

Liu Wei-Ping,Sidney Jeffrey B.

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Geometry and Topology,Algebra and Number Theory

Link

http://link.springer.com/content/pdf/10.1007/BF00383965.pdf

Reference4 articles.

1. AgnetisAllessandro (1989) No-wait flow shop scheduling with large lot size, Rap. 16.89, Dipartimento di Informatica e Sistemistica, Universita Degli Studi di Roma ?La Sapienza?, Rome, Italy.

2. Wei-Ping Liu and Jeffrey B. Sidney (revised 1994) Ordinal algorithms for parallel machine scheduling, to appear in Operations Research Letters.

3. Wei-Ping Liu and Jeffrey B. Sidney (1994) Bin packing using semi-ordinal data, to appear in Operations Research Letters.

4. MenipazEhud (1984) Essentials of Production and Operations Management, Prentice-Hall, Englewood Cliffs, NJ.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel solutions for ordinal scheduling with a small number of machines;Journal of Combinatorial Optimization;2023-07-24

2. Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data;Information and Computation;2005-01

3. Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system;Science in China Series F;2004

4. κ-Partitioning problems for maximizing the minimum load;Computers & Mathematics with Applications;2003-11

5. Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times;Computers & Mathematics with Applications;2002-06