Skip to main content
SpringerLink
Log in

An efficient search method for multi-objective flexible job shop scheduling problems

  • Published:
Journal of Intelligent Manufacturing Aims and scope Submit manuscript

Abstract

Flexible job shop scheduling is very important in both fields of production management and combinatorial optimization. Owing to the high computational complexity, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches. Motivated by some empirical knowledge, we propose an efficient search method for the multi-objective flexible job shop scheduling problems in this paper. Through the work presented in this work, we hope to move a step closer to the ultimate vision of an automated system for generating optimal or near-optimal production schedules. The final experimental results have shown that the proposed algorithm is a feasible and effective approach for the multi-objective flexible job shop scheduling problems.

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.

Similar content being viewed by others

References

  • Asano M., Ohta H. (2002) A heuristic for job shop scheduling to minimize total weighted tardiness. Computers & Industrial Engineering 42: 137–147

    Article  Google Scholar 

  • Brandimarte P. (1993) Routing and scheduling in a flexible job shop by taboo search. Annals of Operations Research 41: 157–183

    Article  Google Scholar 

  • Branke, J. (1999). Memory-enhanced evolutionary algorithms for dynamic optimization problems. In Proceedings of congress on evolutionary computation (pp. 1875–1882).

  • Bruker P., Schlie R. (1990) Job-shop scheduling with multi-purpose machines. Computing 45: 369–375

    Article  Google Scholar 

  • Chen H., Luh P.B. (2003) An alternative framework to Lagrangian relaxation approach for job shop scheduling. European Journal of Operational Research 149: 499–512

    Article  Google Scholar 

  • Chung, C. J., & Reynolds, R. G. (1996). A test-bed for solving optimization problems using cultural algorithm. In Proceedings of the fifth annual conference on evolutionary programming (pp. 225–236). IEEE Press.

  • Dauzere-Peres S., Paulli J. (1997) An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Annals of Operations Research 70: 281–306

    Article  Google Scholar 

  • Fonseca D.J., Navaresse D. (2002) Artificial neural networks for job shop simulation. Advanced Engineering Informatics 16: 241–246

    Article  Google Scholar 

  • Goncalves J.F. et al (2005) A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research 167: 77–95

    Article  Google Scholar 

  • He T., Liu W.H., Liang L.P. (2001) A class of job shop scheduling based on evolutionary algorithm. Computer Integrated Manufacturing Systems 7(1): 47–50

    Google Scholar 

  • Hsu, T., Dupas, R., Jolly, D., & Goncalves, G. (2002). Evaluation of mutation heuristics for the solving of multi-objective flexible job shop by an evolutionary algorithm. In Proceedings of the international conference on systems, man and cybernetics (pp. 6–9). IEEE Press.

  • Ho, N. B., & Tay, J. C. (2004). GENACE: An efficient cultural algorithm for solving the flexible job-shop problem. Congress on Evolutionary Computation (pp. 1759–1766). IEEE Press.

  • Ho, N. B., & Tay, J. C. (2005). Evolving dispatching rules for solving the flexible job-shop problem. In The IEEE congress on evolutionary computation (pp. 2848–2855). IEEE Press.

  • Ho N.B., Tay J.C., Lai E.M.K. (2007) An effective architecture for learning and evolving flexible job-shop schedules. European Journal of Operational Research 179: 316–333

    Article  Google Scholar 

  • Huang K.L., Liao C.J. (2008) Ant colony optimization combined with tabu search for the job shop scheduling problem. Computers and Operations Research 35(4): 1030–1046

    Article  Google Scholar 

  • Huang W.Q., Yin A.H. (2004) An improved shifting bottleneck procedure for the job shop scheduling problem. Computers & Operations Research 31: 2093–2110

    Article  Google Scholar 

  • Hurink E., Jurisch B., Thole M. (1994) Tabu search for the job shop scheduling problem with multi-purpose machines. Operations Research Spektrum 15: 205–215

    Article  Google Scholar 

  • Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness. Management Science Research Project Report, Research Report 43, Los Angeles: University of California.

  • Jansen K., Mastrolilli M., Solis-Oba R. (2005) Approximation schemes for job shop scheduling problems with controllable processing times. European Journal of Operational Research 167: 297–319

    Article  Google Scholar 

  • Jensen M.T. (2003) Generating robust and flexible job shop schedules using genetic algorithms. IEEE Transactions on Evolutionary Computation 7(3): 275–288

    Article  Google Scholar 

  • Kacem I., Hammadi S., Borne P. (2002a) Approach by localization and multi-objective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man, and Cybernetics, Part C 32(1): 1–13

    Article  Google Scholar 

  • Kacem I., Hammadi S., Borne P. (2002b) Pareto-optimality approach for flexible job-shop scheduling problems: Hybridization of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation 60: 245–276

    Article  Google Scholar 

  • Kolonko M. (1999) Some new results on simulated annealing applied to the job shop scheduling problem. European Journal of Operational Research 113: 123–136

    Article  Google Scholar 

  • Liang X., Huang M. (2005) Application of tabu search-parallel genetic algorithm for job-shop scheduling. Computer Integrated Manufacturing Systems 11(5): 678–681

    Google Scholar 

  • Louis S.J., McDonnell J. (2004) Learning with case-injected genetic algorithms. IEEE Transactions on Evolutionary Computation 8(4): 316–328

    Article  Google Scholar 

  • Mastrolilli M., Gambardella L.M. (2002) Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling 3(1): 3–20

    Article  Google Scholar 

  • Mati, Y., Rezg, N., & Xie, X. L. (2001). An integrated greedy heuristic for a flexible job shop scheduling problem. In IEEE International Conference on Systems, Man, and Cybernetics (pp. 2534–2539). IEEE Press.

  • Mattfeld D.C., Bierwirth C. (2004) An efficient genetic algorithm for job shop scheduling with tardiness objectives. European Journal of Operational Research 155: 616–630

    Article  Google Scholar 

  • Michalski R.S. (2000) Learnable evolution model: Evolution process guided by machine learning. Machine Learning 38: 9–40

    Article  Google Scholar 

  • Najid, N. M., Dauzere-Peres, S., & Zaidat, A. (2002). A modified simulated annealing method for flexible job shop scheduling problem. In IEEE international conference on systems, man and cybernetics, IEEE Press.

  • Neifar, F., Gzara, M., Moukrim, A., & Loukil, T. (2006). Hybrid evolutionary algorithm with insertion heuristics for the flexible job shop problem. In International conference on service systems and service management (pp. 1211–1216). IEEE Press.

  • Park B.J., Choi H.R., Kim H.S. (2003) A hybrid genetic algorithm for the job shop scheduling problems. Computers & Industrial Engineering 45: 597–613

    Article  Google Scholar 

  • Pezzella F., Merelli E. (2000) A tabu search method guided by shifting bottleneck for the job shop scheduling problem. European Journal of Operational Research 120: 297–310

    Article  Google Scholar 

  • Reynolds, R. G. (1994). An introduction to cultural algorithms. In Proceedings of the third annual conference on evolutionary programming (pp. 131–139). River Edge, NJ: World Scientific.

  • Santosa C.A., Spimb J.A., Garcia A. (2003) Mathematical modeling and optimization strategies (genetic algorithm and knowledge base) applied to the continuous casting of steel. Engineering Applications of Artificial Intelligence 16(5–6): 511–527

    Article  Google Scholar 

  • Smith W. (1956) Various optimizers for single-stage production. Naval Research Logistics Quarterly 3: 59–66

    Article  Google Scholar 

  • Tamaki, H., Ono, T., Murao, H., & Kitamura, S. (2001). Modeling and genetic solution of a class of flexible job shop scheduling problems. In Proceedings of the 8th IEEE international conference on emerging technologies and factory automation (pp. 343–350). IEEE Press.

  • Tanev I.T., Uozumi T., Morotome Y. (2004) Hybrid evolutionary algorithm-based real-world flexible job shop scheduling problem: Application service provider approach. Applied Soft Computing 5: 87–100

    Article  Google Scholar 

  • Tarantilis C.D., Kiranoudis C.T. (2002) A list-based threshold accepting method for job shop scheduling problems. International Journal of Production Economics 77: 159–171

    Article  Google Scholar 

  • Tung L.F., Li L., Nagi R. (1999) Multi-objective scheduling for the hierarchical control of flexible manufacturing systems. The International Journal of Flexible Manufacturing Systems 11: 379–409

    Article  Google Scholar 

  • Vachhani P., Rengaswamy R., Venkatasubramanian V. (2001) A framework for integrating diagnostic knowledge with nonlinear optimization for data reconciliation and parameter estimation in dynamic systems. Chemical Engineering Science 56(6): 2133–2148

    Article  Google Scholar 

  • Vilcot, G., Billaut, J. C., & Esswein, C. (2006). A genetic algorithm for a bicriteria flexible job shop scheduling problem. In International conference on service systems and service management (pp. 1240–1244). IEEE Press.

  • Wang C.Q., Cao Y.F., Dai G.Z. (2005) Bi-directional convergence aco for job-shop scheduling. Computer Integrated Manufacturing Systems 10(7): 820–824

    Google Scholar 

  • Wang L. (2005) A hybrid genetic algorithm-neural network strategy for simulation optimization. Applied Mathematics and Computation 170(2): 1329–1343

    Article  Google Scholar 

  • Wang S.F., Zou Y.R. (2003) Techniques for the job shop scheduling problem: A survey. System Engineering Theory and Practice 23(1): 49–55

    Google Scholar 

  • Wang X.H., Qiao Q.L., Wang Z.O. (2001) A method to solve job-shop schedule problems by neural network with transient chaos. System Engineering 19(3): 43–48

    Google Scholar 

  • Watanabe M., Ida K., Gen M. (2005) A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem. Computers & Industrial Engineering 48: 743–752

    Article  Google Scholar 

  • Wu D.W., Lu T.D., Liu X.B. et al (2005) Parallel simulated annealing algorithm for solving job-shop scheduling problem. Computer Integrated Manufacturing Systems 11(6): 847–850

    Google Scholar 

  • Wu Z.B., Weng M.X. (2005) Multiagent scheduling method with earliness and tardiness objectives in flexible job shops. IEEE Transactions on Systems, Man and Cybernetics, Part B 35(2): 293–301

    Article  Google Scholar 

  • Xia W.J., Wu Z.M. (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering 48: 409–425

    Article  Google Scholar 

  • Yang X.M., Zeng J.C. (2004a) Multi-individual-crossover genetic algorithm for job shop scheduling problem. Computer Integrated Manufacturing Systems 10(9): 1114–1119

    Google Scholar 

  • Yang, X. M., & Zeng, J. C. (2004b). Branch genetic algorithm applied to the flexible job shop scheduling problem. In Fifth world congress on intelligent control and automation (pp. 2850–2853), Hangzhou. IEEE Press.

Download references

Author information

Authors and Affiliations

  1. Department of Management Science and Engineering, College of Information System and Management, National University of Defense Technology, Changsha, 410073, China

    Li-Ning Xing, Ying-Wu Chen & Ke-Wei Yang

Authors
  1. Li-Ning Xing
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ying-Wu Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ke-Wei Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Li-Ning Xing.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xing, LN., Chen, YW. & Yang, KW. An efficient search method for multi-objective flexible job shop scheduling problems. J Intell Manuf 20, 283–293 (2009). https://doi.org/10.1007/s10845-008-0216-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-008-0216-z

Keywords

Search

Navigation