Scheduling an unbounded batching machine with family jobs and setup times
We consider the problem of scheduling n jobs on an unbounded batching machine that can process any number of jobs belonging to the same family simultaneously in the same batch. All jobs in the same batch complete at the same time. Jobs belonging to different families cannot be processed in the same batch, and setup times are required to switch between batches that process jobs from different families. For a fixed number of families m, we present a generic forward dynamic programming algorithm that solves the problem of minimizing an arbitrary regular cost function in pseudopolynomial time. We also present a polynomial-time backward dynamic programming algorithm with time complexity O (mn(n/m+1)m) for minimizing any additive regular minsum objective function and any incremental regular minmax objective function. The effectiveness of our dynamic programming algorithm is shown by computational experiments based on the scheduling of the heat-treating process in a steel manufacturing plant.
Volume (Year): 63 (2012)
Issue (Month): 2 (February)
|Contact details of provider:|| Web page: http://www.palgrave-journals.com/|
|Order Information:|| Postal: Palgrave Macmillan Journals, Subscription Department, Houndmills, Basingstoke, Hampshire RG21 6XS, UK|
Web: http://www.palgrave-journals.com/pal/subscribe/index.html Email:
When requesting a correction, please mention this item's handle: RePEc:pal:jorsoc:v:63:y:2012:i:2:p:160-167. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Daniel Foley)
If references are entirely missing, you can add them using this form.