On-line algorithms for minimizing makespan on batch processing machines.
- Published in:
- Naval Research Logistics, 2001, v. 48, n. 3, p. 241, doi. 10.1002/nav.5
- By:
- Publication type:
- Article
Works matching IS 0894069X AND DT 2001 AND VI 48 AND IP 3
Results: 5
1
2
Minimizing makespan on a single batch processing machine with nonidentical job sizes.
- Published in:
- Naval Research Logistics, 2001, v. 48, n. 3, p. 226, doi. 10.1002/nav.4
- By:
- Publication type:
- Article
3
Generating Pareto-optimal boundary points in multiparty negotiations using constraint proposal method.
- Published in:
- Naval Research Logistics, 2001, v. 48, n. 3, p. 210, doi. 10.1002/nav.3
- By:
- Publication type:
- Article
4
Optimal control of an M/G/1 queue with impatient priority customers.
- Published in:
- Naval Research Logistics, 2001, v. 48, n. 3, p. 201, doi. 10.1002/nav.2
- By:
- Publication type:
- Article
5
Extending the MAD portfolio optimization model to incorporate downside risk aversion.
- Published in:
- Naval Research Logistics, 2001, v. 48, n. 3, p. 185, doi. 10.1002/nav.1
- By:
- Publication type:
- Article