Result 1 to 20 of 58 total
Network scheduling techniques for construction project management. (English)
Nonconvex Optimization and Its Applications. 16. Dordrecht: Kluwer Academic Publishers. xii, 333 p. Dfl. 260.00; \sterling 114.00; \$ 169.00 (1997).
1
Machine scheduling. (English)
Aarts, Emile (ed.) et al., Local search in combinatorial optimization. Chichester: Wiley. 361-414 (1997).
2
Location, scheduling, design and integer programming. (English)
International Series in Operations Research \& Management Science. 3. Dordrecht: Kluwer Academic Publishers. xi, 220 p. Dfl 175.00; \$ 95.00; \sterling 67.50 (1996).
3
Network programming in Windows NT. (English)
Reading, MA: Addison-Wesley. x, 620 p. \$ 46.50 (1996).
4
The optimality of LEPT in parallel machine scheduling. (English)
J. Appl. Probab. 31, No.3, 788-796 (1994).
5
Nonpreemptive scheduling of independent tasks with prespecified processor allocations. (English)
Nav. Res. Logist. 41, No.7, 959-971 (1994).
6
Minimal networks: the Steiner problem and its generalizations. (English)
Boca Raton, FL: CRC Press. xviii, 414 p. \$ 78.00 (1994).
7
Resource-constrained project scheduling. Exact methods for the multi-mode case. (English)
Lecture Notes in Economics and Mathematical Systems. 409. Berlin: Springer-Verlag. xii, 142 p. DM 60.00; öS 468.00; sFr. 60.00 (1994).
8
A branch and bound algorithm for the job-shop scheduling problem. (English)
Discrete Appl. Math. 49, No.1-3, 107-127 (1994).
9
Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays. (English)
Inf. Comput. 105, No.1, 94-104 (1993).
10
Scheduling jobs in shops with multi-purpose machines. (English)
Osnabrück: Univ., FB Math./ Inf. 107 p. (1992).
11
Polygon scheduling. (English)
Osnabrück: Univ., FB Math./Inf. 68 p. (1992).
12
Some results on Liu’s conjecture. (English)
SIAM J. Discrete Math. 5, No.4, 500-523 (1992).
13
Jackson’s rule for single-machine scheduling: Making a good heuristic better. (English)
Math. Oper. Res. 17, No.1, 22-35 (1992).
14
Linear programming models for load balancing. (English)
Comput. Oper. Res. 18, No.1, 59-64 (1991).
15
A new branch and bound algorithm for project scheduling with resource constraints. (English)
Zastosow. Mat. 21, No.2, 273-282 (1991).
16
Lexicographical scheduling problem on three machine open shop. (English)
Math. Jap. 36, No.6, 1001-1014 (1991).
17
Optimal assignment of total-work-content due-dates and sequencing in a single-machine shop. (English)
J. Oper. Res. Soc. 42, No.2, 177-181 (1991).
18
An application of the bin-packing technique to job scheduling on uniform processors. (English)
J. Oper. Res. Soc. 42, No.2, 169-172 (1991).
19
Cyclic sequencing problems in the two-machine permutation flow shop: Complexity, worst-case, and average-case analysis. (English)
Nav. Res. Logist. 37, No.5, 679-694 (1990).
20
Result 1 to 20 of 58 total
Start
Contact
Print
General Help
