A university-timetabling problem and its solution using Benders’ partitioning—a case study.
- Published in:
- Journal of Scheduling, 2010, v. 13, n. 2, p. 131, doi. 10.1007/s10951-009-0157-1
- By:
- Publication type:
- Article
Works in Journal of Scheduling, 2010, Vol 13, Issue 2
Results: 6
1
2
A random generator of resource-constrained multi-project network problems.
- Published in:
- Journal of Scheduling, 2010, v. 13, n. 2, p. 143, doi. 10.1007/s10951-009-0131-y
- By:
- Publication type:
- Article
3
Minimizing the total weighted completion time in the relocation problem.
- Published in:
- Journal of Scheduling, 2010, v. 13, n. 2, p. 123, doi. 10.1007/s10951-009-0151-7
- By:
- Publication type:
- Article
4
Characterizing sets of jobs that admit optimal greedy-like algorithms.
- Published in:
- Journal of Scheduling, 2010, v. 13, n. 2, p. 163, doi. 10.1007/s10951-009-0148-2
- By:
- Publication type:
- Article
5
Group-scheduling problems in electronics manufacturing.
- Published in:
- Journal of Scheduling, 2010, v. 13, n. 2, p. 177, doi. 10.1007/s10951-009-0147-3
- By:
- Publication type:
- Article
6
Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching.
- Published in:
- Journal of Scheduling, 2010, v. 13, n. 2, p. 111, doi. 10.1007/s10951-009-0135-7
- By:
- Publication type:
- Article