Journal of Intelligent Manufacturing

, Volume 21, Issue 1, pp 111–119 | Cite as

Pruning by dominance in best-first search for the job shop Scheduling problem with total flow time

  • María R. Sierra
  • Ramiro Varela


Best-First search is a problem solving paradigm that allows to design exact or admissible algorithms. In this paper, we confront the Job Shop Scheduling problem with total flow time minimization by means of the A * algorithm. We devised a heuristic from a problem relaxation that relies on computing Jackson’s preemptive schedules. In order to reduce the effective search space, we formalized a method for pruning nodes based on dominance relations and established a rule to apply this method efficiently during the search. By means of experimental study, we show that the proposed method is more efficient than a genetic algorithm in solving instances with 10 jobs and 5 machines and that pruning by dominance allows A * to reach optimal schedules, while these instances are not solved by A * otherwise. These experiments have also made it clear that the Job Shop Scheduling problem with total flow time minimization is harder to solve than the same problem with makespan minimization.


Job shop scheduling Total flow time minimization Best first search Admissible heuristics Pruning by dominance 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bierwirth C. (1995) A generalized permutation approach to jobshop scheduling with genetic algorithms. OR Spectrum 17: 87–92Google Scholar
  2. Blazewicz, J., Ecker, K.~H., Pesch, E., Schmidt, G., & Werglarz, J. (1996). Scheduling computer and manufacturing processes. Springer.Google Scholar
  3. Brucker, P. (2004). Scheduling algorithms (4th edn.). Springer.Google Scholar
  4. Brucker P., Jurisch B., Sievers B. (1994) A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49: 107–127CrossRefGoogle Scholar
  5. Brucker, P., & Knust, S. (2006). Complex scheduling. Springer.Google Scholar
  6. Carlier J., Pinson E. (1989) An algorithm for solving the job-shop problem. Management Science 35(2): 164–176CrossRefGoogle Scholar
  7. Carlier J., Pinson E. (1994) Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research, 78: 146–161CrossRefGoogle Scholar
  8. Dell’ Amico M., Trubian M. (1993) Applying Tabu search to the job-shop scheduling problem. Annals of Operational Research, 41: 231–252CrossRefGoogle Scholar
  9. Giffler B., Thomson G. L. (1960) Algorithms for solving production scheduling problems. Operations Research 8: 487–503CrossRefGoogle Scholar
  10. González M.A., Sierra M., Vela C.R., Varela R. (2006) Genetic algorithms hybridized with greedy algorithms and local search over the spaces of active and semi-active schedules. Lecture Notes in Computer Science, 4177: 231–240CrossRefGoogle Scholar
  11. Hart P., Nilsson N., Raphael B. (1968) A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems, Science and Cybernetics 4(2): 100–107CrossRefGoogle Scholar
  12. Kreipl S. (2000) A large step rendom walk for minimizing total weighted tardiness in a job shop. Journal of Scheduling, 3: 125–138CrossRefGoogle Scholar
  13. Mattfeld D.C. (1995). Evolutionary search and the job shop investigations on genetic algorithms for production scheduling. Springer-Verlag.Google Scholar
  14. Nilsson N. (1980) Principles of artificial intelligence. Tioga, Palo Alto, CAGoogle Scholar
  15. Nowicki E., Smutnicki C. (1996) A fast taboo search algorithm for the job shop scheduling problem. Management Science, 42: 797–813CrossRefGoogle Scholar
  16. Pearl, J. (1984). Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley.Google Scholar
  17. Sadeh N., Fox M.S. (1996) Variable and value ordering heuristics for the job shop scheduling constraint satisfaction problem. Artificial Intelligence 86: 1–41CrossRefGoogle Scholar
  18. Sierra, M., & Varela, R. (2005). Optimal scheduling with heuristic best first search. In Proceedings of AI*IA’2005, Lecture Notes in Computer Science, Vol. 3673, pp. 173–176.Google Scholar
  19. Sierra, M., & Varela, R. (2007). Pruning by dominance in best-first search. In Proceedings of CAEPIA’2007, Vol. 2, pp. 289–298.Google Scholar
  20. Varela R., Soto E. (2002) Sheduling as heuristic search with state space reduction. Lecture Notes in Computer Science 2527: 815–824CrossRefGoogle Scholar
  21. Yamada, T., & Nakano, R. (1996). Scheduling by genetic local search with multi-step crossover. In Proceedings of Fourth International Conference On Parallel Problem Solving from Nature (PPSN IV 1996), pp. 960–969.Google Scholar
  22. Zhang C.Y., Li P., Rao Y., Guan Z. (2008) A very fast ts/sa algorithm for the job shop scheduling problem. Computers and Operations Research 35: 282–294CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2008

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of OviedoGijonSpain

Personalised recommendations