Author:
Bock Stefan,Pinedo Michael
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference20 articles.
1. Baptiste, P. (1999). Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing time. Journal of Scheduling, 2, 245–252.
2. Baptiste, P. (2000). Scheduling equal-length jobs on identical parallel machines. Discrete Applied Mathematics, 103, 21–32.
3. Baptiste, P., & Brucker, P. (2004). Scheduling equal processing time jobs. In J. Y-T. Leung (Ed.), Handbook of scheduling—algorithms, models, and performance analysis: 14-1–14-37.
4. Baptiste, P., & Timkovsky, V. (2004). Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time. Mathematical Methods of Operations Research (ZOR), 60, 145–153.
5. Baptiste, P., Brucker, P., Knust, S., & Timkovsky, V. G. (2004a). Ten notes on equal-processing-time scheduling. At the frontier of solvability in polynomial time. 4OR: Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2, 111–127.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献