139 search results - page 7 / 28 » Scheduling equal-length jobs on identical parallel machines |
CIAC
2006
Springer
15 years 1 months ago
2006
Springer
ORL
2008
14 years 9 months ago
2008
SIAMCOMP
2010
14 years 4 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
IJMTM
2011
14 years 4 months ago
2011
: In this paper, we address a lot splitting and scheduling problem existent in a textile factory. The factory we study produces a set of products that are made of, or assembled fro...
ESA
1999
Springer
15 years 2 months ago
1999
Springer
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...