Skip to main content
SpringerLink
Log in

Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups

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

Abstract

We propose a new method of sequential and parallel speeding up of the process of solving a single machine scheduling problem with total tardiness cost function. This improvement is done on two levels: generating a neighborhood inside path relinking method (basing on new approach—blocks in solutions) and parallelization of generating paths. The obtained results are compared to the benchmark ones taken from the literature. It was possible to find new the best solutions for many benchmark instances by using the proposed method.

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

References

  • Alba E., Troya J.M. (2001) Analyzing synchronous and asynchronous parallel distributed genetic algorithms. Future Generation Computer Systems 17: 451–465

    Article  Google Scholar 

  • Badeau P., Guertin F., Gendreau M., Potvin J.Y., Taillard E. (1997) A parallel tabu search heuristic for the vehicle routing problem with time windows. Transportation Research-C 5: 109–122

    Article  Google Scholar 

  • Bożejko, W., & Wodecki, M. (2004). Parallel genetic algorithm for minimizing total weighted completion time. In Lecture Notes in Computer Science No. 3070 (pp. 400–405). Springer.

  • Cicirello, V. A. (2006). Non-wrapping order crossover: An order preserving crossover operator that respect absolute position. In 8th Annual genetic and evolutionary computation conference GECCO 2006 (pp. 1125–1131). ACM Press.

  • Cicirello V.A., Smith S.F. (2005) Enhancing stochastic search performance by value-based randomization of heuristics. Journal of Heuristics 11: 5–34

    Article  Google Scholar 

  • Crainic, T. G., & Toulouse, M. (1998). Parallel metaheuristics. In T. G. Crainic & G. Laporte (Eds.), Fleet management and logistics (pp. 205–251). Kluwer.

  • Fiechter C.N. (1994) A parallel tabu search algorithm for large traveling salesman problems. Discrete Applied Mathematics 51: 243–267

    Article  Google Scholar 

  • Gagné C., Price W.L., Gravel M. (2002) Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times. Journal of the Operational Research Society 53: 895–906

    Article  Google Scholar 

  • James T., Rego C., Glover F. (2005) Sequential and Parallel Path-Relinking Algorithms for the Quadratic Assignment Problem. IEEE Intelligent Systems 20(4): 58–65

    Google Scholar 

  • Lee Y.H., Bhaskaran K., Pinedo M. (1997) A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions 29: 45–52

    Article  Google Scholar 

  • Lenstra J.K., Rinnoy Kan A.G.H., Brucker P. (1977) Complexity of Machine Scheduling Problems. Annals of Discrete Mathematics 1: 343–362

    Article  Google Scholar 

  • Liao C.-J., Juan H.C. (2007) An ant opimization for single-machine tardiness shceduling with sequence-dependent setups. Computers & Operations Research 34: 1899–1909

    Article  Google Scholar 

  • Lin S.-W., Ying K.-C. (2007) Solving single-machine total weighted tardiness problems with sequence-dependent setup times by meta-heuristics. International Journal of Advanced Manufacturing Technology 34(11–12): 1183–1190

    Article  Google Scholar 

  • Reeves C.R., Yamada T. (1998) Solving the Csum Permutation Flowshop Scheduling Problem by Genetic Local Search. IEEE International Conference on Evolutionary Computation 1998: 230–234

    Google Scholar 

  • Steinhöfel K., Albrecht A., Wong C.K. (2002) Fast parallel heuristics for the job shop scheduling problem. Computers and Operations Research 29: 151–169

    Article  Google Scholar 

  • Tan K.C., Narasimban R., Rubin P.A., Ragatz G.L. (2000) A comparison on four methods for minimizing total tardiness on a single procesor with sequence dependent setup times. Omega 28: 313–326

    Article  Google Scholar 

  • Valente J.M.S., Alves R.A.F.S. (2008) Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups. Computers & Operations Research 35: 2388–2405

    Article  Google Scholar 

  • Wodecki M. (2008) A branch-and-bound parallel algorithm for single-machine total weighted tardiness problem. The International Journal of Advanced Manufacturing Technology 37(9–10): 996–1004

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Janiszewskiego 11-17, Wrocław, 50-372, Poland

    Wojciech Bożejko

Authors
  1. Wojciech Bożejko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wojciech Bożejko.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bożejko, W. Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups. J Intell Manuf 21, 777–785 (2010). https://doi.org/10.1007/s10845-009-0253-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10845-009-0253-2

Keywords

Search

Navigation