Result 1 to 12 of 12 total
A note on “A LP-based heuristic for a time-constrained routing problem”. (English)
Eur. J. Oper. Res. 221, No. 2, 306-307 (2012).
1
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem. (English)
Comput. Oper. Res. 38, No. 6, 967-983 (2011).
2
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (English)
Computers & OR 38, No. 6, 967-983 (2011).
3
Robust crew pairing for managing extra flights. (English)
Comput. Oper. Res. 36, No. 6, 2031-2048 (2009).
4
Distributed algorithms for delay bounded minimum energy wireless broadcasting (English)
IJITN 1, No. 2, 46-65 (2009).
5
Hop constrained energy-efficient broadcasting: insights from massively dense ad hoc networks (English)
IEEE Trans. Mob. Comput. 8, No. 2, 188-202 (2009).
6
Robust crew pairing for managing extra flights (English)
Computers & OR 36, No. 6, 2031-2048 (2009).
7
Preemption in single machine earliness/tardiness scheduling. (English)
J. Sched. 10, No. 4-5, 271-292 (2007).
8
A practical routing and MAC framework for maximum lifetime sensor telemetry (English)
IEICE Transactions 90-B, No. 11, 3146-3157 (2007).
9
Wireless systems maximum precision-lifetime curve for joint sensor selection and data routing in sensor networks (English)
European Transactions on Telecommunications 18, No. 7, 815-823 (2007).
10
Joint sensor selection and data routing in sensor networks (English)
NETWORKING, 828-839 (2005).
11
Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs. (English)
Nav. Res. Logist. 51, No. 3, 407-445 (2004).
12
Result 1 to 12 of 12 total
Start
Contact
Print
General Help
