Author:
Brauner N.,Finke G.,Lehoux-Lebacque V.,Rapine C.,Kellerer H.,Potts C.,Strusevich V.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science,Management Information Systems,Management Science and Operations Research
Reference7 articles.
1. Breit J, Schmidt G, Strusevich VA (2003) Non-preemptive two-machine open shop scheduling with non-availability constraints. Math Methods Oper Res 34: 217–234
2. Brucker P, Dhaenens-Flipo C, Knust S, Kravchenko SA, Werner F (2002) Complexity results for parallel machine problems with a single server. J Schedul 5: 429–457
3. Hall NG, Potts C, Sriskandarajah C (2000) Parallel machine scheduling with a common server. Discrete Appl Math 102: 223–243
4. Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin
5. Lebacque V, Brauner N, Celse B, Finke G, Rapine C (2007) Planification d’expériences dans l’industrie chimique, Chap. 1, pp 21–32. Dans Les systèmes de production applications interdisciplinaires et mutations sous la direction de Boujut J-F, Llerena D, Brissaud D, Hermès-Lavoisier, ISBN 978-2-7462-1819-2
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献