Result 1 to 20 of 391 total
An evolutionary algorithm for the resource-constrained project scheduling problem with minimum and maximum time lags. (English)
J. Sched. 14, No. 4, 391-406 (2011).
1
Minimizing the number of late jobs on a single machine under due date uncertainty. (English)
J. Sched. 14, No. 4, 351-360 (2011).
2
Scheduling unit length jobs on parallel machines with lookahead information. (English)
J. Sched. 14, No. 4, 335-350 (2011).
3
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations. (English)
J. Sched. 14, No. 4, 371-389 (2011).
4
A set partitioning reformulation of a school bus scheduling problem. (English)
J. Sched. 14, No. 4, 307-318 (2011).
5
A best online algorithm for unbounded parallel-batch scheduling with restarts to minimize makespan. (English)
J. Sched. 14, No. 4, 361-369 (2011).
6
Inverse scheduling: Two-machine flow-shop problem. (English)
J. Sched. 14, No. 3, 239-256 (2011).
7
Parametric algorithms for 2-cyclic robot scheduling with interval processing times. (English)
J. Sched. 14, No. 3, 267-279 (2011).
8
On the one-dimensional stock cutting problem in the paper tube industry. (English)
J. Sched. 14, No. 3, 281-290 (2011).
9
A job-shop problem with one additional resource type. (English)
J. Sched. 14, No. 3, 225-237 (2011).
10
Modelling and solving grid resource allocation problem with network resources for workflow applications. (English)
J. Sched. 14, No. 3, 291-306 (2011).
11
Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. (English)
J. Sched. 14, No. 3, 257-265 (2011).
12
Special issue: ECCO XXI. Selected papers based on the presentations at the 21st annual meeting of the European Chapter on Combinatorial Optimization, Dubrovnik, Croatia, May 29‒32, 2008. (English)
J. Sched. 14, No. 3, 221-306 (2011).
13
Capacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups. (English)
J. Sched. 14, No. 2, 209-219 (2011).
14
Complex university course timetabling. (English)
J. Sched. 14, No. 2, 187-207 (2011).
15
New competitive results for the stochastic resource-constrained project scheduling problem: exploring the benefits of pre-processing. (English)
J. Sched. 14, No. 2, 157-171 (2011).
16
Scheduling deteriorating jobs on a single machine subject to breakdowns. (English)
J. Sched. 14, No. 2, 173-186 (2011).
17
On robust online scheduling algorithms. (English)
J. Sched. 14, No. 2, 141-156 (2011).
18
Understanding the behavior of solution-guided search for job-shop scheduling. (English)
J. Sched. 14, No. 2, 121-140 (2011).
19
On the part inventory model sequencing problem: complexity and beam search heuristic. (English)
J. Sched. 14, No. 1, 17-25 (2011).
20
Result 1 to 20 of 391 total
Start
Contact
Print
General Help
