Parallel machine match-up scheduling with manufacturing cost considerations

Parallel machine match-up scheduling with manufacturing cost considerations

Many scheduling problems in practice involve rescheduling of disrupted schedules. In this study, we show that in contrast to fixed processing times, if we have the flexibility to control the processing times of the jobs, we can generate alternative reactive schedules considering the manufacturing cost implications in response to disruptions. We consider a non-identical parallel machining enviro...

Match-up scheduling under a machine breakdown

When a machine breakdown forces a modi®ed ̄ow shop (MFS) out of the prescribed state, the proposed strategy reschedules part of the initial schedule to match up with the preschedule at some point. The objective is to create a new schedule that is consistent with the other production planning decisions like material ̄ow, tooling and purchasing by utilizing the time critical decision making conce...

Scheduling parallel CNC machines with time/cost trade-off considerations

When the processing times of jobs are controllable, selected processing times affect both themanufacturing cost and the scheduling performance.Awell-known example for such a case that this paper specifically deals with is the turning operation on a CNCmachine. Manufacturing cost of a turning operation is a nonlinear convex function of its processing time. We also know that scheduling decisions ...

Machine Scheduling with Transportation Considerations

Approximation Algorithms for Parallel Machine Scheduling with Speed-up Resources

We consider the problem of scheduling with renewable speed-up resources. Given m identical machines, n jobs and c different discrete resources, the task is to schedule each job non-preemptively onto one of the machines so as to minimize the makespan. In our problem, a job has its original processing time, which could be reduced by utilizing one of the resources. As resources are different, the ...