Author:
Baptiste Philippe,Brucker Peter,Chrobak Marek,Dürr Christoph,Kravchenko Svetlana A.,Sourd Francis
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference10 articles.
1. Baptiste, Ph., “Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal,” Journal of Scheduling, 2, 245–252 (1999).
2. Baptiste Ph., J. Carlier, A. Kononov, M. Queyranne, S. Sevastyanov, and M. Sviridenko, “Structural properties of preemptive schedules,” Journal of Scheduling (to appear).
3. Brucker, P., B. Jurisch, and M. Jurisch, “Open-shop problems with unit time operations,” Zeitschrift für Operations Research, 37, 59–73 (1993).
4. Du, J., J. Y.-T. Leung, and G. H. Young, “Minimizing mean flow time with release time constraint,” Theoretical Computer Science, 75, 347–355 (1990).
5. Herrbach, L. A. and J. Y.-T. Leung, “Preemptive scheduling of equal length jobs on two machines to minimize mean flow time,” Operations Research, 38, 487–494 (1990).
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献