Flexible servers in tandem lines with setup costs
Queueing Systems: Theory and Applications
Dynamic control of a flexible server in an assembly-type queue with setup costs
Queueing Systems: Theory and Applications
Asymptotically optimal schedules for single-server flow shop problems with setup costs and times
Operations Research Letters
| Hi-index | 0.00 |
We consider processing and shipment scheduling of a batch of sizeM jobs on a flexible (multifunctional) machine. All jobs in the batch require the same sequence ofN operations on the machine. Costs are incurred in the forms of holding costs of jobs waiting for the next operation, setup costs whenever the machine is set up for a new operation, and shipment cost whenever the whole batch or a part of it is shipped to the customer. Using a dynamic programming formulation of the problem, we first show how the problem size increases inM andN . Then, by focusing on the properties of some classes of batch-splitting policies, a heuristic algorithm is presented that generates suboptimal policies. Some numerical results are provided which show that the algorithm performs very well.