《2016 Heuristic Methods for Solving Job-Shop Scheduling Problems》.pdf

Heuristic Methods for Solving Job-Shop Scheduling Problems A. Garrido, M. A. Salido, F. Barber, M. A. López Dpto. Sistemas Informáticos y Computación Universidad Politécnica de Valencia, Camino de Vera s/n 46071 Valencia, Spain {agarridot, msalido, fbarber}@dsic.upv.es Abstract interested in the relaxation of the heuristic variable and Solving scheduling problems with Constraint Satisfaction value orderings to obtain a more flexible method, which Problems (CSP’s) techniques implies a wide space search makes a better use of the knowledge the scheduler may with a large number of variables, each one of them with a have about each particular problem. Our work is focused wide interpretation domain. This paper discusses the on job-shop scheduling problems. In these problems, application of CSP heuristic techniques (based on the operations must be scheduled within their feasible time concept of slack of activities) for variable and value windows (i.e.: between its respective earliest start time and ordering on a special type of job-shop scheduling problems latest finish time). We propose heuristic techniques for in which the operations must schedule inside of temporal variable and value orderings to be included in two k