283 search results - page 9 / 57 » A survey of scheduling problems with setup times or costs |
ICTCS
2001
Springer
13 years 12 months ago
2001
Springer
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
EOR
2006
13 years 7 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
SQJ
2008
13 years 7 months ago
2008
There are many methods for estimating size, effort, schedule and other cost aspects of IS projects, but only one specifically developed for Enterprise Resource Planning (ERP) [67]...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We consider the problem of scheduling n independent jobs on m identical machines that operate in parallel. Each job has a controllable processing time. The fact that the jobs have...
RTAS
2010
IEEE
13 years 5 months ago
2010
IEEE
—The problem of scheduling a set of tasks on a multiprocessor architecture is addressed. Tasks are assumed to be sporadic with arbitrary deadlines and may migrate between process...