Martin G. Martinez-Rangel

Martin G. Martinez-Rangel

Auto-generated profile, based on publicly available information

Martin G. Martinez-Rangel

Universidad Autónoma del Estado de Morelos

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 July 2015 in International Transactions in Operational Research
Verified
Journal Article
Open access
PDF file
Marco Antonio Cruz-ChavezMarco Antonio Cruz-Chavez
Marco Antonio Cruz-Chavez
MMMartín G. Martínez‐Rangel
Martín G. Martínez‐Rangel
Martín Heriberto Cruz-RosalesMartín Heriberto Cruz-Rosales
Martín Heriberto Cruz-Rosales
This paper presents a simulated annealing algorithm accelerated by a partial scheduling mechanism and a cooling schedule mechanism that is a function of the standard deviation. This facilitates a rapid approach to good solutions in the flexible job shop scheduling problem (FJSSP). The results demonstrate that for benchmark instances of several sizes, simulated annealing that implements the proposed mechanism converges more quickly to good solutions than simulated annealing that does not implement the proposed mechanism.

12 August 2008 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
Marco Antonio Cruz-ChavezMarco Antonio Cruz-Chavez
Marco Antonio Cruz-Chavez
ODOcotlan Diaz-Parra
Ocotlan Diaz-Parra
DJDavid Juárez-Romero
David Juárez-Romero
MMMartín G. Martínez-Rangel
Martín G. Martínez-Rangel

1 September 2007
Verified
Conference Paper
Closed access
Marco Antonio Cruz-ChavezMarco Antonio Cruz-Chavez
Marco Antonio Cruz-Chavez
MMMartin G. Martinez-Rangel
Martin G. Martinez-Rangel
J. A. HernándezJ. A. Hernández
J. A. Hernández
JZJose Crispin Zavala-Diaz
Jose Crispin Zavala-Diaz
ODOcotlan Diaz-Parra
Ocotlan Diaz-Parra
This paper presents an algorithm that applies a new mechanism in order to generate scheduling which allows for evaluation of the quality of solutions that are obtained in the job shop scheduling problem (JSSP). In this research, the quality of the solution is evaluated by using the makespan as an objective function. It is demonstrated experimentally that the proposed algorithm has better efficiency and efficacy when compared to the classic form of scheduling generation used to evaluate the quality of the solution in the JSSP. The efficiency and efficacy obtained by the proposed algorithm make it possible to generate and evaluate a greater number of better quality solutions in less time, so a greater exploration of the solution space for the JSSP can be conducted.

1 November 2012
Verified
Conference Paper
Closed access
Pedro MorenoPedro Moreno
Pedro Moreno
Marco Antonio Cruz-ChavezMarco Antonio Cruz-Chavez
Marco Antonio Cruz-Chavez
ARAbelardo Rodríguez-León
Abelardo Rodríguez-León
Otoniel López GranadoOtoniel López Granado
Otoniel López Granado
MMManuel Perez Malumbres
Manuel Perez Malumbres
JJJazmín Yanel Juárez-Chávez
Jazmín Yanel Juárez-Chávez
In this paper a new sign coding approximation method for the wavelet coefficients in a 2D image codec based on a simulated annealing metaheuristic is presented. The efficiency of the proposed algorithm versus a genetic algorithm using benchmarks of Kodak is compared and showing that the proposed sign prediction algorithm is efficient and provides a significant reduction of wavelet coefficients sign information in the final bit-stream. The results show that, by including sign coding capabilities to a nonembedded encoder, the sign compression gain is up to 17.35%, being the rate-distortion (R/D) performance improvement up to 0.25 dB.

1 September 2007
Verified
Conference Paper
Closed access
Marco Antonio Cruz-ChavezMarco Antonio Cruz-Chavez
Marco Antonio Cruz-Chavez
ODOcotlan Diaz-Parra
Ocotlan Diaz-Parra
J. A. HernándezJ. A. Hernández
J. A. Hernández
JZJose Crispin Zavala-Diaz
Jose Crispin Zavala-Diaz
MMMartin G. Martinez-Rangel
Martin G. Martinez-Rangel
This paper presents an algorithm called CSP-IRPTW for the vehicles routing problem with time windows (VRPTW), which applies the PCP method (precedence constraint posting) used for models of scheduling as a CSP (constraint satisfaction problem). PCP involves the calculation of the shortest path in partial and global form, between pairs of nodes and among all the nodes respectively, in the graph that represents the VRPTW model. In order to apply PCP to VRPTW, the problem is treated as a CSP. The results show that the proposed search algorithm is efficient in the search for the global optimum for some problems.

1 January 2014
Verified
Book Chapter
Closed access
PDF file
Marco Antonio Cruz-ChavezMarco Antonio Cruz-Chavez
Marco Antonio Cruz-Chavez
AMAlina Martínez-Oropeza
Alina Martínez-Oropeza
JPJesús del Carmen Peralta-Abarca
Jesús del Carmen Peralta-Abarca
MCMartín Heriberto Cruz-Rosales
Martín Heriberto Cruz-Rosales
MMMartín Martínez-Rangel
Martín Martínez-Rangel