Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Toward Various Exact Modeling the Job Shop Scheduling Problem for Minimizing Total Weighted Tardiness
verfasst von : Mohammad Namakshenas, Rashed Sahraeian
Erschienen in: Managing Complexity
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Abstract
In this paper, two different mixed integer programming (MIP) and one constraint programming (CP) models are formulated for classical job shop problem with the aim at minimization of the total weighted tardiness as objective function. The proposed models are solved and compared with well-known benchmarks in the job shop literature, using IBM ILog Cplex software. Examination and comparison of these exact models suggest that one formulation performs much more efficiently than others, namely CP model, in triple criteria: First, number of generated variables; Second, solution time and Third, complexity scale.