IDEAS home Printed from https://ideas.repec.org/a/igg/joris0/v3y2012i2p24-45.html
   My bibliography  Save this article

A Pareto-Optimal Solution for a Multi-Objective Scheduling Problem with Periodic Maintenance Requirement

Author

Listed:
  • Deniz Mungan

    (Cyprus Mobile Telecommunication Ltd, Cyprus)

  • Junfang Yu

    (Southern Methodist University, USA)

  • Bhaba R. Sarker

    (Louisiana State University, USA)

  • Mohammad Anwar Rahman

    (University of Southern Mississippi, USA)

Abstract

A Pareto-optimal solution is developed in this paper for a scheduling problem on a single machine with periodic maintenance and non-preemptive jobs. Most of the scheduling problems address only one objective function, while in the real world, such problems are always associated with more than one objective. In this paper, both multi-objective functions and multi-maintenance periods are considered for a machine scheduling problem. To avoid complexities, multiple objective functions are consolidated and transformed into a single objective function after they are weighted and assigned proper weighting factors. In addition, periodic maintenance schedules are also considered in the model. The objective of the model addressed is to minimize the weighted function of the total job flow time, the maximum tardiness, and the machine idle time in a single machine problem with periodic maintenance and non-preemptive jobs. An algorithm is developed to solve this multiple criterion problem and to construct the Pareto-set. The parametric analysis of the trade-offs of all solutions with all possible weighted combination of the criteria is performed. A neighborhood search heuristic is also developed. Results are provided to explore the best schedule among all the Pareto-optimality sets and to compare the result of the modified Pareto-optimality algorithm with the result of the neighborhood search heuristic.

Suggested Citation

  • Deniz Mungan & Junfang Yu & Bhaba R. Sarker & Mohammad Anwar Rahman, 2012. "A Pareto-Optimal Solution for a Multi-Objective Scheduling Problem with Periodic Maintenance Requirement," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 3(2), pages 24-45, April.
    • Handle: RePEc:igg:joris0:v:3:y:2012:i:2:p:24-45
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/joris.2012040102
    Download Restriction: no
    ---><---

    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:igg:joris0:v:3:y:2012:i:2:p:24-45. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.