IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v112y2008i1p151-160.html
   My bibliography  Save this article

Minimizing the makespan for the MPM job-shop with availability constraints

Author

Listed:
  • Zribi, N.
  • El Kamel, A.
  • Borne, P.

Abstract

In this paper, we deal with the Job-shop with Multi-Purpose Machine scheduling problem with Availability Constraints (JMPMAC). In the first part, we propose a heuristic, based on priority rules to solve the assignment problem. A local search algorithm is then introduced to improve this assignment solution. In the second part, we introduce a genetic algorithm to solve the sequencing problem. Finally, a new lower bound is developed for the problem to evaluate the quality of solutions.

Suggested Citation

  • Zribi, N. & El Kamel, A. & Borne, P., 2008. "Minimizing the makespan for the MPM job-shop with availability constraints," International Journal of Production Economics, Elsevier, vol. 112(1), pages 151-160, March.
    • Handle: RePEc:eee:proeco:v:112:y:2008:i:1:p:151-160
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(07)00134-X
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    References listed on IDEAS

    as
    1. Schmidt, Gunter, 2000. "Scheduling with limited machine availability," European Journal of Operational Research, Elsevier, vol. 121(1), pages 1-15, February.
    2. Sheldon B. Akers & Joyce Friedman, 1955. "A Non-Numerical Approach to Production Scheduling Problems," Operations Research, INFORMS, vol. 3(4), pages 429-442, November.
    3. Carlier, Jacques, 1987. "Scheduling jobs with release dates and tails on identical machines to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 29(3), pages 298-306, June.
    4. Lee, Chung-Yee, 1999. "Two-machine flowshop scheduling with availability constraints," European Journal of Operational Research, Elsevier, vol. 114(2), pages 420-429, April.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Behrooz Shahbazi & Seyed Habib A. Rahmati, 2021. "Developing a Flexible Manufacturing Control System Considering Mixed Uncertain Predictive Maintenance Model: a Simulation-Based Optimization Approach," SN Operations Research Forum, Springer, vol. 2(4), pages 1-43, December.
    2. Li, Jun-qing & Pan, Quan-ke, 2013. "Chemical-reaction optimization for solving fuzzy job-shop scheduling problem with flexible maintenance activities," International Journal of Production Economics, Elsevier, vol. 145(1), pages 4-17.
    3. Seyed Habib A. Rahmati & Abbas Ahmadi & Kannan Govindan, 2018. "A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach," Annals of Operations Research, Springer, vol. 269(1), pages 583-621, October.
    4. Chiang, Tsung-Che & Lin, Hsiao-Jou, 2013. "A simple and effective evolutionary algorithm for multiobjective flexible job shop scheduling," International Journal of Production Economics, Elsevier, vol. 141(1), pages 87-98.
    5. Dauzère-Pérès, Stéphane & Ding, Junwen & Shen, Liji & Tamssaouet, Karim, 2024. "The flexible job shop scheduling problem: A review," European Journal of Operational Research, Elsevier, vol. 314(2), pages 409-432.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Aggoune, Riad & Portmann, Marie-Claude, 2006. "Flow shop scheduling problem with limited machine availability: A heuristic approach," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 4-15, February.
    2. Seyed Habib A. Rahmati & Abbas Ahmadi & Kannan Govindan, 2018. "A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach," Annals of Operations Research, Springer, vol. 269(1), pages 583-621, October.
    3. Allaoui, H. & Lamouri, S. & Artiba, A. & Aghezzaf, E., 2008. "Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 112(1), pages 161-167, March.
    4. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    5. Hnaien, Faicel & Yalaoui, Farouk & Mhadhbi, Ahmed, 2015. "Makespan minimization on a two-machine flowshop with an availability constraint on the first machine," International Journal of Production Economics, Elsevier, vol. 164(C), pages 95-104.
    6. Liao, Ching-Jong & Shyur, Der-Lin & Lin, Chien-Hung, 2005. "Makespan minimization for two parallel machines with an availability constraint," European Journal of Operational Research, Elsevier, vol. 160(2), pages 445-456, January.
    7. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.
    8. Mohamed Haouari & Lotfi Hidri & Anis Gharbi, 2006. "Optimal Scheduling of a Two-stage Hybrid Flow Shop," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 107-124, August.
    9. Ali Salmasnia & Danial Mirabadi-Dastjerd, 2017. "Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 544-578, October.
    10. Detienne, Boris, 2014. "A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints," European Journal of Operational Research, Elsevier, vol. 235(3), pages 540-552.
    11. Allaoui, H. & Artiba, A. & Elmaghraby, S.E. & Riane, F., 2006. "Scheduling of a two-machine flowshop with availability constraints on the first machine," International Journal of Production Economics, Elsevier, vol. 99(1-2), pages 16-27, February.
    12. M. A. Kubzin & V. A. Strusevich, 2006. "Planning Machine Maintenance in Two-Machine Shop Scheduling," Operations Research, INFORMS, vol. 54(4), pages 789-800, August.
    13. Lee, Chung-Yee & Lin, Chen-Sin, 2001. "Single-machine scheduling with maintenance and repair rate-modifying activities," European Journal of Operational Research, Elsevier, vol. 135(3), pages 493-513, December.
    14. Aggoune, Riad, 2004. "Minimizing the makespan for the flow shop scheduling problem with availability constraints," European Journal of Operational Research, Elsevier, vol. 153(3), pages 534-543, March.
    15. Wang, Xiuli & Cheng, T.C.E., 2015. "A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint," International Journal of Production Economics, Elsevier, vol. 161(C), pages 74-82.
    16. Tao Ren & Yan Zhang & Shuenn-Ren Cheng & Chin-Chia Wu & Meng Zhang & Bo-yu Chang & Xin-yue Wang & Peng Zhao, 2020. "Effective Heuristic Algorithms Solving the Jobshop Scheduling Problem with Release Dates," Mathematics, MDPI, vol. 8(8), pages 1-25, July.
    17. Agnetis, Alessandro & Kellerer, Hans & Nicosia, Gaia & Pacifici, Andrea, 2012. "Parallel dedicated machines scheduling with chain precedence constraints," European Journal of Operational Research, Elsevier, vol. 221(2), pages 296-305.
    18. Faicel Hnaien & Taha Arbaoui, 2023. "Minimizing the makespan for the two-machine flow shop scheduling problem with random breakdown," Annals of Operations Research, Springer, vol. 328(2), pages 1437-1460, September.
    19. Gerardo Minella & Rubén Ruiz & Michele Ciavotta, 2008. "A Review and Evaluation of Multiobjective Algorithms for the Flowshop Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 451-471, August.
    20. Carlier, J. & Pinson, E. & Sahli, A. & Jouglet, A., 2020. "An O(n2) algorithm for time-bound adjustments for the cumulative scheduling problem," European Journal of Operational Research, Elsevier, vol. 286(2), pages 468-476.

    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:eee:proeco:v:112:y:2008:i:1:p:151-160. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.