IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/928312.html
   My bibliography  Save this article

Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs

Author

Listed:
  • Wenming Cheng
  • Peng Guo
  • Zeqiang Zhang
  • Ming Zeng
  • Jian Liang

Abstract

In many real scheduling environments, a job processed later needs longer time than the same job when it starts earlier. This phenomenon is known as scheduling with deteriorating jobs to many industrial applications. In this paper, we study a scheduling problem of minimizing the total completion time on identical parallel machines where the processing time of a job is a step function of its starting time and a deteriorating date that is individual to all jobs. Firstly, a mixed integer programming model is presented for the problem. And then, a modified weight-combination search algorithm and a variable neighborhood search are employed to yield optimal or near-optimal schedule. To evaluate the performance of the proposed algorithms, computational experiments are performed on randomly generated test instances. Finally, computational results show that the proposed approaches obtain near-optimal solutions in a reasonable computational time even for large-sized problems.

Suggested Citation

  • Wenming Cheng & Peng Guo & Zeqiang Zhang & Ming Zeng & Jian Liang, 2012. "Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs," Mathematical Problems in Engineering, Hindawi, vol. 2012, pages 1-20, September.
    • Handle: RePEc:hin:jnlmpe:928312
    DOI: 10.1155/2012/928312
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2012/928312.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2012/928312.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2012/928312?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
    ---><---

    Citations

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


    Cited by:

    1. Shuwan Zhu & Wenjuan Fan & Xueping Li & Shanlin Yang, 2023. "Ambulance dispatching and operating room scheduling considering reusable resources in mass-casualty incidents," Operational Research, Springer, vol. 23(2), pages 1-37, June.

    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:hin:jnlmpe:928312. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.