On-Line Algorithms for a Single Machine Scheduling Problem-Reference-Cited by-同舟云学术

On-Line Algorithms for a Single Machine Scheduling Problem

Published:1995 Issue: Volume: Page:157-173
ISSN:1387-666X
Container-title:The Impact of Emerging Technologies on Computer Science and Operations Research
language:
Short-container-title:

Author:

Mao Weizhen,Kincaid Rex K.,Rifkin Adam

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4615-2223-2_8.pdf

Reference25 articles.

1. S. Chand, R. Traub, and R. Uzsoy, 1993. Single machine scheduling with dynamic arrivals:Decomposition results and a forward algorithm, technical Report 93-10, School of Industrial Engineering, Purdue University, West Lafayette, IN.

2. C. Chu, 1992. Efficient heuristics to minimize total flow time with release dates, Oper. Res. Lett. IS, 321–330.

3. R. W. Conway, W. L. Maxwell, and L. W. Miller, 1967. Theory of Schedul ing, Addison-Wesley, Reading, MA.

4. J. S. Deogun, 1983. On scheduling with ready times to minimize mean flow time, Comput. J. 26, 320–328.

5. M. I. Dessouky and J. S. Deogun, 1981. Sequencing jobs with unequal ready times to minimize mean flow time, SIAM J. Comput. 10, 192–202.

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

1. Accounting for large jobs for a single-processor online model;2022 8th International Conference on Optimization and Applications (ICOA);2022-10-06

2. Scheduling ortsfester Gebrauchsfaktoren;Produktionstheorie 4;2021

3. A Review of Machine Scheduling: Complexity, Algorithms and Approximability;Handbook of Combinatorial Optimization;1998

4. Optimal on-line algorithms for single-machine scheduling;Integer Programming and Combinatorial Optimization;1996