|
Journals in DBLP
J. Scheduling 2004, volume: 7, number: 5
- Wenci Yu, Han Hoogeveen, Jan Karel Lenstra
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard. [Citation Graph (0, 0)][DBLP] J. Scheduling, 2004, v:7, n:5, pp:333-348 [Journal]
- Peter Damaschke
Scheduling Search Procedures. [Citation Graph (0, 0)][DBLP] J. Scheduling, 2004, v:7, n:5, pp:349-364 [Journal]
- Ari Freund, Joseph Naor
Approximating the Advertisement Placement Problem. [Citation Graph (0, 0)][DBLP] J. Scheduling, 2004, v:7, n:5, pp:365-374 [Journal]
- H. Neil Geismar, Milind Dawande, Chelliah Sriskandarajah
Robotic Cells with Parallel Machines: Throughput Maximization in Constant Travel-Time Cells. [Citation Graph (0, 0)][DBLP] J. Scheduling, 2004, v:7, n:5, pp:375-395 [Journal]
- Dirk C. Mattfeld
Conference Diary. [Citation Graph (0, 0)][DBLP] J. Scheduling, 2004, v:7, n:5, pp:397-399 [Journal]
|