Toward Various Exact Modeling the Job Shop Scheduling Problem for Minimizing Total Weighted Tardiness
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.
KeywordsJob shop Total weighted tardiness Mixed integer programming Constraint programming
- 2.IBM Ilog CP (2009) Detailed scheduling in IBM ILOG CPLEX optimization studio with IBM ILOG CPLEX CP Optimizer. http://cpoptimizer.ilog.com. Accessed 16 sept 2012
- 5.Singer M, Pinedo M (1997) A computational study of branch and bound techniques for minimizing the total weighted tardiness in job shops. IIE Trans 30(2):109–118Google Scholar