One-machine, N-product-type, continuous-time scheduling with a common due date: a polynomially solvable case

✍ Scribed by Konstantin Kogan

• Book ID: 110252447
• Publisher: Taylor and Francis Group
• Year: 2001
• Tongue: English
• Weight: 155 KB
• Volume: 33
• Category: Article
• ISSN: 0740-817X
• DOI: 10.1023/a:1007627405948