IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v70y2019i10p1830-1847.html
   My bibliography  Save this article

Scheduling step-deteriorating jobs on bounded parallel-batching machines to maximise the total net revenue

Author

Listed:
  • Jun Pei
  • Xingming Wang
  • Wenjuan Fan
  • Panos M. Pardalos
  • Xinbao Liu

Abstract

This paper addresses a parallel-batching scheduling problem considering processing cost and revenue, with the objective of maximising the total net revenue. Specifically, the actual processing time of a job is assumed to be a step function of its starting time and the common due date. This problem involves assigning jobs to different machines, batching jobs, and sequencing batches on each machine. Some key structural properties are proposed for the scheduling problem, based on which an optimal scheduling scheme is developed for any given machine. Then, an effective hybrid VNS–IRG algorithm which combines Variable Neighborhood Search (VNS) and Iterated Reference Greedy algorithm (IRG) is proposed to solve this problem. Finally, the effectiveness and stability of the proposed VNS–IRG are demonstrated and compared with VNS, IRG, and Particle Swarm Optimization through computational experiments.

Suggested Citation

  • Jun Pei & Xingming Wang & Wenjuan Fan & Panos M. Pardalos & Xinbao Liu, 2019. "Scheduling step-deteriorating jobs on bounded parallel-batching machines to maximise the total net revenue," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(10), pages 1830-1847, October.
  • Handle: RePEc:taf:tjorxx:v:70:y:2019:i:10:p:1830-1847
    DOI: 10.1080/01605682.2018.1464428
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1080/01605682.2018.1464428?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:tjorxx:v:70:y:2019:i:10:p:1830-1847. 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/tjor .

    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.