Period of time： 2014年1期
Publisher： Springer Publishing Company
Founded in： 1984
Total resources： 103
ISSN： 0254-5330
Subject： TP Automation Technology , Computer Technology
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Annals of Operations Research,volume 92,issue 1
Menu
By Glazebrook K.D.,Niño-Mora J. in (1999)
Annals of Operations Research,volume 92,issue 1 , Vol. 92, Iss. 1, 1999-01 , pp.
Access to resources
Recommend
Almost optimal policies for stochastic systemswhich almost satisfy conservation laws
By Glazebrook K.D.,Garbe R. in (1999)
Annals of Operations Research,volume 92,issue 1 , Vol. 92, Iss. 1, 1999-01 , pp.Heuristic algorithms for job-shop scheduling problemswith stochastic precedence constraints
By Neumann K.,Schneider W.G. in (1999)
Annals of Operations Research,volume 92,issue 1 , Vol. 92, Iss. 1, 1999-01 , pp.Scheduling multi-operation jobs on a single machine
By Gerodimos A.E.,Glass C.A.,Potts C.N.,Tautenhahn T. in (1999)
Annals of Operations Research,volume 92,issue 1 , Vol. 92, Iss. 1, 1999-01 , pp.Single-machine scheduling to minimize maximumtardiness with minimum number of tardy jobs
By Gupta J.N.D.,Hariri A.M.A.,Potts C.N. in (1999)
Annals of Operations Research,volume 92,issue 1 , Vol. 92, Iss. 1, 1999-01 , pp.The setup polytope of N-sparse posets
By Schrader R.,Wambach G. in (1999)
Annals of Operations Research,volume 92,issue 1 , Vol. 92, Iss. 1, 1999-01 , pp.Recovering cyclic schedules from delay
Annals of Operations Research,volume 92,issue 1 , Vol. 92, Iss. 1, 1999-01 , pp.A new lower bound for the open-shop problem
By Guéret C.,Prins C. in (1999)
Annals of Operations Research,volume 92,issue 1 , Vol. 92, Iss. 1, 1999-01 , pp.A polynomial algorithm for the three-machineopen shop with a bottleneck machine
By Drobouchevitch I.G.,Strusevich V.A. in (1999)
Annals of Operations Research,volume 92,issue 1 , Vol. 92, Iss. 1, 1999-01 , pp.
Previous
Next