A general approach for optimizing regular criteria in the job-shop scheduling problem


Even though a very large number of solution methods has been developed for the jobshop scheduling problem, the majority are designed for the makespan criterion. In this paper, we propose a general approach for optimizing any regular criterion in the job-shop scheduling problem. The approach is a local search method that uses a disjunctive graph model and… (More)
DOI: 10.1016/j.ejor.2011.01.046


16 Figures and Tables