Advanced Search
MyIDEAS: Login to save this article or follow this journal

Scheduling an unbounded batching machine with family jobs and setup times

Contents:

Author Info

  • R Zheng

    (1] Pudong Academy of Reform and Development, Shanghai, China[2] Fudan University, Shanghai, China)

  • H Li

    (Fudan University, Shanghai, China)

  • X Zhang

    (Fudan University, Shanghai, China)

Registered author(s):

Abstract

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.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: http://www.palgrave-journals.com/jors/journal/v63/n2/pdf/jors2010187a.pdf
File Function: Link to full text PDF
Download Restriction: Access to full text is restricted to subscribers.

File URL: http://www.palgrave-journals.com/jors/journal/v63/n2/full/jors2010187a.html
File Function: Link to full text HTML
Download Restriction: Access to full text is restricted to subscribers.

As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

Bibliographic Info

Article provided by Palgrave Macmillan in its journal Journal of the Operational Research Society.

Volume (Year): 63 (2012)
Issue (Month): 2 (February)
Pages: 160-167

as in new window
Handle: RePEc:pal:jorsoc:v:63:y:2012:i:2:p:160-167

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
Email:
Web: http://www.palgrave-journals.com/pal/subscribe/index.html

Related research

Keywords:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

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: (Elizabeth Gale).

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

If references are entirely missing, you can add them using this form.

If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

Please note that corrections may take a couple of weeks to filter through the various RePEc services.