Skip to main content

Advertisement

SpringerLink
Log in

RETRACTED ARTICLE: OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

This article was retracted on 27 November 2018

This article has been updated

Abstract

The problem of open-shop scheduling includes a set of activities which must be performed on a limited set of machines. The goal of scheduling in open-shop is the presentation of a scheduled program for performance of the whole operation, so that the ending performance time of all job operations will be minimised. The open-shop scheduling problem can be solved in polynomial time when all nonzero processing times are equal, becoming equivalent to edge coloring that has the jobs and workstations as its vertices and that has an edge for every job-workstation pair with a nonzero processing time. For three or more workstations, or three or more jobs, with varying processing times, open-shop scheduling is NP-hard. Different algorithms have been presented for open-shop scheduling so far. However, most of these algorithms have not considered the machine maintenance problem. Whilst in production level, each machine needs maintenance, and this directly influences the assurance reliability of the system. In this paper, a new genetic-based algorithm to solve the open-shop scheduling problem, namely OSGA, is developed. OSGA considers machine maintenance. To confirm the performance of OSGA, it is compared with DGA, SAGA and TSGA algorithms. It is observed that OSGA performs quite well in terms of solution quality and efficiency in small and medium enterprises (SMEs). The results support the efficiency of the proposed method for solving the open-shop scheduling problem, particularly considering machine maintenance especially in SMEs’.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Change history

  • 27 November 2018

    The Editor-in-Chief has retracted this article because validity of the content of this article cannot be verified.

  • 27 November 2018

    The Editor-in-Chief has retracted this article because validity of the content of this article cannot be verified.

References

  • Alcaide, D., Sicilia, J., & Vigo, D. (1997). Atabu search algorithmfor the open-shop problem. Top, 5, 283–286.

    Article  Google Scholar 

  • Andresen, M., Brasel, H., Morig, M., Tusch, J., Werner, F., & Willenius, P. (2008). Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop. Mathematical and Computer Modelling, 48, 1279–1293.

    Article  Google Scholar 

  • Baccarelli, E., Cordeschi, N., & Patriarca, T. (2012). QoS stochastic traffic engineering for the wireless support of real-time streaming applications. Computer Networks, 56(1), 287–302.

    Article  Google Scholar 

  • Baccarelli, E., Cordeschi, N., & Polli, V. (2013). Optimal self-adaptive qos resource management in interference-affected multicast wireless networks. IEEE/ACM Transactions on Networking (TON), 21(6), 1750–1759.

    Article  Google Scholar 

  • Brasel, H., Tautenhahn, T., & Werner, F. (1993). Constructive heuristic algorithms for the open-shop problem. Computing, 51, 95–110.

    Article  Google Scholar 

  • Brucker, P., Hurink, J., Jurish, B., & Wostmann, B. (1997). A branch and bound Algorithm for the open-shop problem. Discrete Applied Mathematics, 76, 43–59.

    Article  Google Scholar 

  • Chan, F. T. S., Chung, S. H., Chan, L. Y., Finke, G., & Tiwari, M. K. (2006). Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach. Robotics and Computer Integrated Manufacturing, 22, 5–6.

    Google Scholar 

  • Cheng, R., Gen, M., & Tsujimura, Y. (1996). A tutorial survey of job-shop scheduling problems using genetic algorithms-I. representation. Computers & Industrial Engineering, 30, 983–997.

    Article  Google Scholar 

  • Dorndorf, U., Pesch, E., & Phan-Huy, T. (2001). Solving the open-shop scheduling problem. Journal of Scheduling, 4, 157–174.

    Article  Google Scholar 

  • Glover, F., & Laguna, M. (1997). Tabu search. Norwell, MA: Kluwer Academic Publishers.

    Book  Google Scholar 

  • Gonzalez, S., & Sahni, T. (1976). Open-shop scheduling to minimize finish time. Journal of the Assooauon for Computing Machinery, 23, 665–679.

    Article  Google Scholar 

  • Gueret, C., & Prins, C. (1998). Classical and new heuristics for theshop problem: A computational evaluation. European Journal of Operational Research, 107, 306–314.

    Article  Google Scholar 

  • Hosseinabadi, A. A. R., Kardgar, M., Shojafar, M., Shamshirband, S., & Abraham, A. (2014a). GELS-GA: Hybrid metaheuristic algorithm for solving multiple travelling salesman problem (pp. 76–81). 14th IEEE ISDA.

  • Hosseinabadi, A. A. R., Siar, H., Shamshirband, S., Shojafar, M., & Nasir M. H. N. M. (2014b). Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in Small and Medium Enterprises. Annals of Operations Research, 1–24.

  • Kordon, A. M., & Rebaine, D. (2010). The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan. European Journal of Operational Research, 203, 42–29.

    Article  Google Scholar 

  • Kubiak, W., Sriskandarajah, C., & Zaras, V. (1991). A note on the complexity of open-shop scheduling problems. INFOR, 29, 284–294.

    Google Scholar 

  • Laarhoven, P. J. M., & Aarts, E. H. L. (1987). Simulated annealing: Theory and applications. Norwell, MA: Kluwer Academic Publishers.

    Book  Google Scholar 

  • Liaw, C. F. (2000). A hybrid genetic algorithm for the open-shop scheduling problem. European Journal of Operational Research, 124, 28–42.

    Article  Google Scholar 

  • Lina, H., Leeb, H., & Pan, W. (2008). Heuristics for scheduling in a no-wait open shop withmovable dedicated machines. International Journal of Production Economics, 111, 368–377.

    Article  Google Scholar 

  • Liu, C. Y., & Bulfin, R. L. (1987). Scheduling ordered open-shops. Computers & Operations Research, 14, 257–264.

    Article  Google Scholar 

  • Low, C., & Yeh, Y. (2009). Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated. Robotics and Computer-Integrated Manufacturing, 25, 314–322.

    Article  Google Scholar 

  • Matta, M. E. (2009). A genetic algorithm for the proportionate multiprocessor open shop. Computers & Operations Research, 36, 2601–2618.

    Article  Google Scholar 

  • Matta, M. E., & Elmaghraby, S. E. (2010). Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop. European Journal of Operational Research, 201, 720–728.

    Article  Google Scholar 

  • Panahi, H., & Moghaddam, R. T. (2011). Solving a multi-objective open shop scheduling problem by a novel hybrid ant colony optimization. Expert Systems with Applications, 38, 2817–2822.

    Article  Google Scholar 

  • Pinedo, M. (1995). Scheduling: Theory algorithms and systems. Englewood Cliffs, NJ: Prentice-Hall.

    Google Scholar 

  • Pooranian, Z., Harounabadi, A., Shojafar, M., & Hedayat, N. (2011). New hybrid algorithm for task scheduling in grid computing to decrease missed task. World Academy of Science, Engineering and Technology, 55, 924–928.

    Google Scholar 

  • Prins, C. (1994). An overview of scheduling problems arising in satellite communications. The Journal of the Operational Research Society, 45, 611–623.

    Article  Google Scholar 

  • Prins, C. (2000). Competitive genetic algorithms for the open-shop scheduling problem. Mathematical Methods of Operations Research, 52, 389–411.

    Article  Google Scholar 

  • Sha, D. Y., & Hsu, Ch Y. (2008). A new particle swarm optimization for the open shop scheduling problem. Computers & Operations Research, 35, 324–3261.

    Article  Google Scholar 

  • Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64, 278–285.

    Article  Google Scholar 

  • Yadollahi, M., & Rahmani, A. M. (2009). Solving distributed flexible manufacturing systems scheduling problems subject to maintenance: Memetic algorithms approach. International Conference on Computer and Information Technology, 1, 36–41.

    Google Scholar 

  • Yu, W., Liu, Zh, Wang, L., & Fan, T. (2011). Routing open shop and flow shop scheduling problems. European Journal of Operational Research, 213, 24–36.

    Article  Google Scholar 

Download references

Acknowledgments

This work has been partially sponsored by University Malaya Research Grant under the grant no: RG327-15AFR and Grant (No. RG316-14AFR). We thank the reviewers and associate editor for their comments which improved this manuscript

Author information

Authors and Affiliations

  1. Department of Computer System and Technology, Faculty of Computer Science and Information Technology, University of Malaya, 50603, Kuala Lumpur, Malaysia

    Shahaboddin Shamshirband

  2. Department of Information Engineering Electronics and Telecommunications (DIET), Sapienza University of Rome, Via Eudossiana 18, 00184, Rome, Italy

    Mohammad Shojafar

  3. Young Research Club, Behshahr Branch, Islamic Azad University, Behshahr, Iran

    A. A. Rahmani Hosseinabadi & Maryam Kardgar

  4. Department of Software Engineering, Faculty of Computer Science and Information Technology, University of Malaya (UM), 50603, Kuala Lumpur, Malaysia

    M. H. N. Md. Nasir & Rodina Ahmad

Authors
  1. Shahaboddin Shamshirband
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Shojafar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. A. Rahmani Hosseinabadi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Maryam Kardgar
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. M. H. N. Md. Nasir
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Rodina Ahmad
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shahaboddin Shamshirband.

Additional information

The Editor-in-Chief has retracted this article because validity of the content of this article cannot be verified. This article showed evidence of peer review and authorship manipulation. None of the co-authors agree to this retraction.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shamshirband, S., Shojafar, M., Hosseinabadi, A.A.R. et al. RETRACTED ARTICLE: OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises. Ann Oper Res 229, 743–758 (2015). https://doi.org/10.1007/s10479-015-1855-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-015-1855-z

Keywords

Search

Navigation