11 search results - page 3 / 3 » aor 2007 |
119
click to vote
AOR
2007
15 years 3 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....