Skip to main content
SpringerLink
Log in

A Molecular Algorithm for an Operation-based Job Shop Scheduling Problem

  • Research Article - Computer Engineering and Computer Science
  • Published:
Arabian Journal for Science and Engineering Aims and scope Submit manuscript

Abstract

This paper proposes a molecular algorithm for a job shop problem based on intermediate time consumed between operations of jobs. This problem is an NP-complete problem in a silicon-based computation environment. Thus, using any parallel algorithm for solving this problem can be useful. In this paper, enormous parallelism power of molecular computation is used. In addition, intermediate consumed time between operations is considered. Our solution consists of specifying one direction of conjunctive edges between each pair of operations using both mask and coloring techniques. Based on the resulted directions in a graph, all the valid schedules are found and, finally, the best one is selected according to the consumed time of all operations. The proposed molecular algorithm performs in the complexity of O(max (n,m)). The effectiveness of this algorithm is verified by a computational simulation.

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

Similar content being viewed by others

Reference

  1. Bulbul K., Kaminsky P., Yano C: Flow shop scheduling with earliness, tardiness and intermediate inventory holding costs. Naval Res. Logist. 51(3), 407–445 (2004)

    Article  MathSciNet  Google Scholar 

  2. Amos, M.: DNA computation. Ph.D. Thesis, Department of Computer Science, University of Warwick, UK (1997)

  3. Hsieh S.-Y., Huange C.-W., Chou H.-H: A DNA-based graph encoding scheme with its application to graph isomorphism problems. Appl. Math. Comput. 203, 502–512 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Adleman L.M: Molecular computation of solutions to combinatorial problems. Science 266, 1021–1029 (1994)

    Article  Google Scholar 

  5. Lipton R: DNA solution of hard computational problem. Science 268, 542–545 (1995)

    Article  Google Scholar 

  6. Lee J.Y., Shin S.Y., Park T.H., Ghang B.T: Solving traveling salesman problems with DNA molecules encoding numerical values. BioSystems 78, 39–47 (2004)

    Article  Google Scholar 

  7. Darehmiraki M., Nehi H.M: Molecular solution to the 0–1 knapsack problem based on DNA computing. Appl. Math. Comput. 187, 1033–1037 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Henkel C.V., Back T., Kok J.N., Rozenberg G., Spaink H.P: DNA computing of solutions to knapsack problems. Biosystem 88, 156–162 (2007)

    Article  Google Scholar 

  9. Moreno A.G: Solving traveling salesman problem in simulation of Genetic algorithm with DNA. Int. J. Inf. Theories Appl. 15, 357–363 (2008)

    Google Scholar 

  10. Sanches C.A.A., Soma N.Y: A polynomial time DNA computing solution for the bin-paking problem. Appl. Math. Comput. 215, 2055–2062 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  11. Sharif Ullah, A.M.M.: A DNA-based computing method for solving control chart pattern recognition problems. CIRP J. Manuf. Sci. Technol. (2011)

  12. Rothemund, P.: A DNA and restriction enzyme implementation of Turing machines. In: Landweber, L.; Baum, E. (eds.) DNA Based Computers, vol. 27. American Mathematical Society, Providence, pp. 75–119 (1996)

  13. Paun G., Rozenberg G., Salomaa A: DNA Computing: New Computing Paradigm. Springer, Berlin (1998)

    Book  Google Scholar 

  14. Amos, M.; Dunne, P.: DNA Solution of Boolean Circuit, Tech. Rep. CTAG-97009. Department of Computer Science, University of Liverpool (1995)

  15. Ogihara, M.; Ray, A.: Simulating Boolean circuit on DNA computers, Algorithmica 2–3, 239–250 (1999)

  16. Wang, L.; Liu, Q.; Frutos, A.; Gillmor, S.; Thiel, A.; Strother, T.; Condon, A.; Corn, R.; Lagally, M.; Smith, L.: Surface-based DNA computing operations: destroy and readout. Biosystems 52(1) (1999)

  17. Winfree, E.: Algorithmic Self-Assembly of DNA, thesis in P.H.D degree, California Institute of Technology, Pasadena (1998)

  18. Qiu Z.F., Lu M: A new approach to advance the DNA computing. Appl. Soft Comput. 3, 177–189 (2003)

    Article  Google Scholar 

  19. Chena X., Wanga N: Optimization of short-time gasoline blending scheduling problemwith a DNA based hybrid genetic algorithm. Chem. Eng. Process. 49, 1076–1083 (2010)

    Article  Google Scholar 

  20. Zhixiang Y., Jianzhong C., Yan Y., Ying M: Job shop scheduling problem based on DNA computing. J. Syst. Eng. Electron. 17(3), 654–659 (2006)

    Article  Google Scholar 

  21. Ahrabian H., Ganjtabesh M., Nowzari-Dalini A: Molecular solution for double and partial digest problems in polynomial time. Comput. Inf. 28, 1001–1020 (2009)

    MathSciNet  Google Scholar 

  22. Ahrabian, H.; Ganjtabesh, M.; Nowzari-Dalini, A.: A Molecular Algorithm for Longest Path Problem

  23. Smithies O: Zone electrophoresis in starch gels: group variations in the serum proteins of normal adults. Biochem. J. 61(4), 629–641 (1955)

    Google Scholar 

  24. Schägger H: Tricine-SDS-PAGE. Nat. Protoc. 1(1), 16–22 (2006)

    Article  Google Scholar 

  25. Beck, J.C.; Prosser, P.; Selensky, E.: Graph transformationsnfor the vehicle routing and job shop scheduling problems. Lecture Notes in Computer Science, vol. 2502, pp. 60–74 (2002)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Mathematical Science, Tarbiat Modares University, P.O. Box 14115-134, Tehran, Iran

    Somayeh Molaei

  2. Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran

    Behnam Vahdani

  3. Department of Knowledge Engineering, University of Economic Science, Tehran, Iran

    Shahram Molaei

Authors
  1. Somayeh Molaei
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Behnam Vahdani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shahram Molaei
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Somayeh Molaei.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Molaei, S., Vahdani, B. & Molaei, S. A Molecular Algorithm for an Operation-based Job Shop Scheduling Problem. Arab J Sci Eng 38, 2993–3003 (2013). https://doi.org/10.1007/s13369-012-0458-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s13369-012-0458-0

Keywords

Search

Navigation