Narrow search
Showing 1 - 10 of 11
Cover Image
Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
Gafarov, Evgeny R.; Lazarev, Alexander A.; Werner, Frank - 2012
Persistent link: https://www.econbiz.de/10009581414
Cover Image
A note on the proof of the complexity of the little-preemptive open-shop problem
Shchepin, Evgeny V.; Vakhania, Nodari - 2011
Persistent link: https://www.econbiz.de/10009803197
Cover Image
Single-Machine Scheduling with Release Times and Tails
Vakhania, Nodari - 2004
Persistent link: https://www.econbiz.de/10008214681
Cover Image
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
Shchepin, Evgeny V.; Vakhania, Nodari - 2008
Persistent link: https://www.econbiz.de/10008221329
Cover Image
A note on the proof of the complexity of the little-preemptive open-shop problem
Shchepin, Evgeny V.; Vakhania, Nodari - 2011
Persistent link: https://www.econbiz.de/10009487118
Cover Image
On the geometry, preemptions and complexity of multiprocessor and shop scheduling
Shchepin, Evgeny V.; Vakhania, Nodari - 2008
Persistent link: https://www.econbiz.de/10003669182
Cover Image
Shop-scheduling problems with fixed and non-fixed machine orders of the jobs
Shakhlevich, N.V.; Sotskov, N.; Werner, F. - 1999
Persistent link: https://www.econbiz.de/10008218218
Cover Image
On the calculation of the stability radius of an optimal or an approximate schedule
Sotskov, Yu N.; Wagelmans, A.P.M.; Werner, F. - 1998
Persistent link: https://www.econbiz.de/10008218917
Cover Image
Batch scheduling with deadlines on parallel machines
Brucker, P.; Kovalyov, M.Y.; Shafransky, Y.M.; Werner, F. - 1998
Persistent link: https://www.econbiz.de/10008218926
Cover Image
Single machine total tardiness maximization problems: complexity and algorithms
Gafarov, Evgeny R.; Lazarev, Alexander A.; Werner, Frank - 2013
Persistent link: https://www.econbiz.de/10010152025