159 search results - page 16 / 32 » Machine Minimization for Scheduling Jobs with Interval Const... |
147
click to vote
AOR
2007
15 years 5 months ago
2007
We consider the job shop scheduling problem unit−Jm, where each job is processed once on each of m given machines. Every job consists of a permutation of tasks for all machines....
167
click to vote
STOC
1996
ACM
15 years 10 months ago
1996
ACM
We consider the problem of scheduling n jobs that are released over time on a single machine in order to minimize the total ow time. This problem is well-known to be NPcomplete, a...
162
click to vote
COR
2007
15 years 5 months ago
2007
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
162
click to vote
COR
2006
15 years 5 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
137
click to vote
CONSTRAINTS
2007
15 years 5 months ago
2007
We study the “inter-distance constraint”, also known as the global minimum distance constraint, that ensures that the distance between any pair of variables is at least equal ...