On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming

DOI10.1016/j.apm.2014.07.032zbMath1432.90063OpenAlexW2051506446MaRDI QIDQ2337226

Rashed. Sahraeian, Mohammad Namakshenas

Publication date: 19 November 2019

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2014.07.032

zbMATH Keywords

combinatoricsmixed integer programmingjob shopconstraint programmingtotal weighted tardiness

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (1)

Flexible job shop scheduling problem for parallel batch processing machine with compatible job families

Uses Software

• CPLEX

Cites Work

• Solving the job-shop scheduling problem optimally by dynamic programming
• A general approach for optimizing regular criteria in the job-shop scheduling problem
• Dominance rules in combinatorial optimization problems
• A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
• A Cutting Plane Algorithm for the Linear Ordering Problem
• Constraint Logic Programming Using ECLⁱPS^e
• Scheduling
• Unnamed Item
• Unnamed Item

This page was built for publication: On the optimal modeling and evaluation of job shops with a total weighted tardiness objective: constraint programming vs. mixed integer programming