Result 61 to 80 of 11517 total
A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals. (English)
Comput. Oper. Res. 39, No. 5, 939-951 (2012).
61
Minimizing the weighted sum of squared tardiness on a single machine. (English)
Comput. Oper. Res. 39, No. 5, 919-928 (2012).
62
An effective shuffled frog-leaping algorithm for resource-constrained project scheduling problem. (English)
Comput. Oper. Res. 39, No. 5, 890-901 (2012).
63
Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage. (English)
Comput. Oper. Res. 39, No. 3, 736-745 (2012).
64
A Lagrangian approach for minimum cost single round robin tournaments. (English)
Comput. Oper. Res. 39, No. 3, 718-727 (2012).
65
Single-machine makespan minimization scheduling with nonlinear shortening processing times. (English)
Comput. Oper. Res. 39, No. 3, 659-663 (2012).
66
A discrete time exact solution approach for a complex hybrid flow-shop scheduling problem with limited-wait constraints. (English)
Comput. Oper. Res. 39, No. 3, 629-636 (2012).
67
Makespan minimization on single batch-processing machine via ant colony optimization. (English)
Comput. Oper. Res. 39, No. 3, 582-593 (2012).
68
Batch scheduling on uniform machines to minimize total flow-time. (English)
Comput. Oper. Res. 39, No. 3, 571-575 (2012).
69
Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time. (English)
Comput. Oper. Res. 39, No. 3, 492-497 (2012).
70
Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates. (English)
Comput. Oper. Res. 39, No. 3, 471-478 (2012).
71
An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem. (English)
Comput. Oper. Res. 39, No. 2, 449-460 (2012).
72
Online scheduling of two job types on a set of multipurpose machines with unit processing times. (English)
Comput. Oper. Res. 39, No. 2, 405-412 (2012).
73
Scheduling jobs on identical machines with agreement graph. (English)
Comput. Oper. Res. 39, No. 2, 382-390 (2012).
74
Scheduling on parallel machines with preemption and transportation delays. (English)
Comput. Oper. Res. 39, No. 2, 374-381 (2012).
75
Development of hybrid evolutionary algorithms for production scheduling of hot strip mill. (English)
Comput. Oper. Res. 39, No. 2, 339-349 (2012).
76
A cutting plane approach for integrated planning and scheduling. (English)
Comput. Oper. Res. 39, No. 2, 320-327 (2012).
77
An improved SAT formulation for the social golfer problem. (English)
Ann. Oper. Res. 194, 427-438 (2012).
78
An effective greedy heuristic for the social golfer problem. (English)
Ann. Oper. Res. 194, 413-425 (2012).
79
An XML format for benchmarks in high school timetabling. (English)
Ann. Oper. Res. 194, 385-397 (2012).
80
Result 61 to 80 of 11517 total