93 search results - page 11 / 19 » A Survey on Approximation Algorithms for Scheduling with Mac... |
COR
2007
13 years 7 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...
EOR
2007
13 years 7 months ago
2007
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a n...
SCHEDULING
2010
13 years 2 months ago
2010
We consider large volume job shop scheduling problems, in which there is a fixed number of machines, a bounded number of activities per job, and a large number of jobs. In large v...
AOR
2007
13 years 7 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....
INFORMS
2000
13 years 7 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...