IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v44y2013i5p926-936.html
   My bibliography  Save this article

Scheduling on parallel machines to minimise maximum lateness for the customer order problem

Author

Listed:
  • Ling-Huey Su
  • Ping-Shun Chen
  • Szu-Yin Chen

Abstract

This article addresses the customer order problem where jobs are scheduled on a set of parallel machines and dispatched in batches. A machine can process only one job at a time, whereas multiple machines can simultaneously process jobs in a batch. The evaluation of the performance is minimisation of maximum lateness. The problem is designated as . Three heuristics, based on simple scheduling rules, for each problem are proposed and their tight worst case bounds are found. Computational experiments are also conducted to evaluate the effectiveness of the heuristics.

Suggested Citation

  • Ling-Huey Su & Ping-Shun Chen & Szu-Yin Chen, 2013. "Scheduling on parallel machines to minimise maximum lateness for the customer order problem," International Journal of Systems Science, Taylor & Francis Journals, vol. 44(5), pages 926-936.
    • Handle: RePEc:taf:tsysxx:v:44:y:2013:i:5:p:926-936
    DOI: 10.1080/00207721.2011.649366
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2011.649366
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2011.649366?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jian Chen & Meilin Wang & Xiang T. R. Kong & George Q. Huang & Qinyun Dai & Guoqiang Shi, 2019. "Manufacturing synchronization in a hybrid flowshop with dynamic order arrivals," Journal of Intelligent Manufacturing, Springer, vol. 30(7), pages 2659-2668, October.
    2. Framinan, Jose M. & Perez-Gonzalez, Paz & Fernandez-Viagas, Victor, 2019. "Deterministic assembly scheduling problems: A review and classification of concurrent-type scheduling models and solution procedures," European Journal of Operational Research, Elsevier, vol. 273(2), pages 401-417.

    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:tsysxx:v:44:y:2013:i:5:p:926-936. 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/TSYS20 .

    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.