Result 1 to 20 of 45 total
Parallel dedicated machines scheduling with chain precedence constraints. (English)
Eur. J. Oper. Res. 221, No. 2, 296-305 (2012).
1
Demand allocation with latency cost functions. (English)
Math. Program. 132, No. 1-2(A), 277-294 (2012).
2
A job-shop problem with one additional resource type. (English)
J. Sched. 14, No. 3, 225-237 (2011).
3
Scheduling problems with unreliable jobs and machines (English)
CTW, 32-35 (2011).
4
Scheduling three chains on two parallel machines. (English)
Eur. J. Oper. Res. 202, No. 3, 669-674 (2010).
5
Single-machine scheduling problems with generalized preemption. (English)
INFORMS J. Comput. 21, No. 1, 1-12 (2009).
6
A Lagrangian approach to single-machine scheduling problems with two competing agents. (English)
J. Sched. 12, No. 4, 401-415 (2009).
7
Computing the Nash solution for scheduling bargaining problems. (English)
Int. J. Oper. Res. 6, No. 1, 54-69 (2009).
8
Sequencing unreliable jobs on parallel machines. (English)
J. Sched. 12, No. 1, 45-54 (2009).
9
Optimal packet-to-slot assignment in mobile telecommunications. (English)
Oper. Res. Lett. 37, No. 4, 261-264 (2009).
10
Covering a line segment with variable radius discs. (English)
Comput. Oper. Res. 36, No. 5, 1423-1436 (2009).
11
Covering a line segment with variable radius discs (English)
Computers & OR 36, No. 5, 1423-1436 (2009).
12
Demand allocation with latency cost functions. (English)
Comput. Res. Repos. 2008, Article No. 0810.1650 (2008).
13
Covering a line segment with variable radius discs. (English)
Comput. Res. Repos. 2007, Article No. 0707.2921 (2007).
14
Multi-agent single machine scheduling. (English)
Ann. Oper. Res. 150, 3-15 (2007).
15
Supply chain scheduling: sequence coordination. (English)
Discrete Appl. Math. 154, No. 15, 2044-2063 (2006).
16
Polynomial algorithms for a two-class multiprocessor scheduling problem in mobile telecommunications systems. (English)
J. Sched. 8, No. 3, 255-273 (2005).
17
An asymptotically exact algorithm for the high-multiplicity bin packing problem. (English)
Math. Program. 104, No. 1 (A), 21-37 (2005).
18
Scheduling problems with two competing agents. (English)
Oper. Res. 52, No. 2, 229-242 (2004).
19
An implicit enumeration scheme for the batch selection problem. (English)
Networks 44, No. 2, 151-159 (2004).
20
Result 1 to 20 of 45 total