Result 1 to 20 of 21 total
Optimal crashing and buffering of stochastic serial projects (English)
IJITPM 1, No. 1, 30-41 (2010).
1
Principles of sequencing and scheduling. (English)
Hoboken, NJ: John Wiley \& Sons (ISBN 978-0-470-39165-5/hbk; 978-0-470-45179-3/ebook). xv, 493~p. EUR~91.70; \sterling~73.50 (2009).
2
Safe scheduling: Setting due dates in single-machine problems. (English)
Eur. J. Oper. Res. 196, No. 1, 69-77 (2009).
3
Minimizing the number of tardy jobs with stochastically-ordered processing times. (English)
J. Sched. 11, No. 1, 71-73 (2008).
4
Setting due dates in a stochastic single machine environment. (English)
Comput. Oper. Res. 33, No. 6, 1681-1694 (2006).
5
Johnson’s problem with stochastic processing times and optimal service level. (English)
Eur. J. Oper. Res. 169, No. 3, 751-760 (2006).
6
Setting due dates in a stochastic single machine environment (English)
Computers & OR 33, 1681-1694 (2006).
7
The think-piece: scientific publishing in the global electronic village some thoughts (English)
IJCSA 2, No. 2, 1-4 (2005).
8
Stochastic scheduling with optimal customer service. (English)
J. Oper. Res. Soc. 52, No. 2, 226-233 (2001).
9
Maximizing the number of mixed packages subject to variety constraints. (English)
Comput. Oper. Res. 26, No.13, 1323-1333 (1999).
10
Pseudo-Gilbert-Steiner trees. (English)
Networks 33, No.3, 175-178 (1999).
11
Maximizing the number of mixed packages subject to variety constraints (English)
Computers & OR 26, No. 13, 1323-1333 (1999).
12
Makespan-related criteria for comparing schedules in stochastic environments. (English)
J. Oper. Res. Soc. 49, No. 11, 1188-1195 (1998).
13
The distribution of points in measurement precision charts. (English)
Math. Sci. 22, No.2, 117-121 (1997).
14
A simple relation between the pattern probability and the rate of false signals in control charts. (English)
Probab. Eng. Inf. Sci. 10, No. 3, 315-323 (1996).
15
Optimal scheduling of purchasing orders for large projects. (English)
Eur. J. Oper. Res. 68, No.2, 185-195 (1993).
16
Optimal multifacility defensive location on planes with rectilinear distances. (English)
Networks 23, No.6, 517-523 (1993).
17
An improved algorithm for Steiner trees. (English)
SIAM J. Appl. Math. 50, No.1, 244-263 (1990).
18
Interconnecting networks in the plane: The Steiner case. (English)
Networks 20, No.1, 93-108 (1990).
19
Augmenting Euclidean networks - the Steiner case. (English)
SIAM J. Appl. Math. 45, 855-860 (1985).
20
Result 1 to 20 of 21 total
Start
Contact
Print
General Help
