@article{(Open Science Index):https://publications.waset.org/pdf/15077,
	  title     = {The Problem of Using the Calculation of the Critical Path to Solver Instances of the Job Shop Scheduling Problem },
	  author    = {Marco Antonio Cruz-Chávez and  Juan Frausto-Solís and  Fernando Ramos-Quintana},
	  country	= {},
	  institution	= {},
	  abstract     = {A procedure commonly used in Job Shop Scheduling Problem (JSSP) to evaluate the neighborhoods functions that use the non-deterministic algorithms is the calculation of the critical path in a digraph. This paper presents an experimental study of the cost of computation that exists when the calculation of the critical path in the solution for instances in which a JSSP of large size is involved. The results indicate that if the critical path is use in order to generate neighborhoods in the meta-heuristics that are used in JSSP, an elevated cost of computation exists in spite of the fact that the calculation of the critical path in any digraph is of polynomial complexity.
},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {1},
	  number    = {1},
	  year      = {2007},
	  pages     = {209 - 212},
	  ee        = {https://publications.waset.org/pdf/15077},
	  url   	= {https://publications.waset.org/vol/1},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 1, 2007},
	}