IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v58y2020i3p863-877.html
   My bibliography  Save this article

Batching and scheduling for a single-machine flexible machining cell with multi-fixturing pallets and controllable processing times

Author

Listed:
  • Jeong-Hoon Shin
  • Jae-Min Yu
  • Hyoung-Ho Doh
  • Hyung-Won Kim
  • Dong-Ho Lee

Abstract

This study addresses an integrated batching and scheduling problem for a single-machine flexible machining cell in which each pallet can load multiple parts, i.e. multi-fixturing pallets, and part processing times can be changed with different processing costs, i.e. controllable processing times. The batching sub-problem is to select the set of parts to be produced in each period of a planning horizon and the resulting scheduling sub-problem is to determine the set of parts to be loaded on each multi-fixturing pallet, the part processing times and the pallet input/processing sequences for the parts selected in each period. A bi-criterion objective is considered that minimises the total tardiness and the total processing cost simultaneously. A solution approach is proposed that consists of three phases from the first to the last period: (a) generating the whole schedule over the planning horizon; (b) selecting the parts to be produced during the current period using the scheduling information; and (c) determining the final schedule for the selected parts. Simulation experiments were done on a number of test instances and the results are reported.

Suggested Citation

  • Jeong-Hoon Shin & Jae-Min Yu & Hyoung-Ho Doh & Hyung-Won Kim & Dong-Ho Lee, 2020. "Batching and scheduling for a single-machine flexible machining cell with multi-fixturing pallets and controllable processing times," International Journal of Production Research, Taylor & Francis Journals, vol. 58(3), pages 863-877, February.
  • Handle: RePEc:taf:tprsxx:v:58:y:2020:i:3:p:863-877
    DOI: 10.1080/00207543.2019.1602742
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2019.1602742
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2019.1602742?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:58:y:2020:i:3:p:863-877. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.