Advertisement
Published in:
2014 | OriginalPaper | Chapter
Toward Various Exact Modeling the Job Shop Scheduling Problem for Minimizing Total Weighted Tardiness
Authors : Mohammad Namakshenas, Rashed Sahraeian
Published in: Managing Complexity
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. 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.