Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
ACM Transactions on Computational Logic (TOCL)
Constraint-Based Scheduling
Mixed Global Constraints and Inference in Hybrid CLP–IP Solvers
Annals of Mathematics and Artificial Intelligence
Mathematical Programming Techniques in Constraint Programming: A Short Overview
Journal of Heuristics
Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
INFORMS Journal on Computing
Constraint and Integer Programming in OPL
INFORMS Journal on Computing
Extending an Algebraic Modeling Language to Support Constraint Programming
INFORMS Journal on Computing
The Role of Integer Programming Techniques in Constraint Programming's Global Constraints
INFORMS Journal on Computing
Constraint programming and maths programming
The Knowledge Engineering Review
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Engineering Applications of Artificial Intelligence
Evaluating optimization models to solve SALBP
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
On supporting Lean methodologies using constraint-based scheduling
Journal of Scheduling
Extending chip in order to solve complex scheduling and placement problems
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
Mixed model assembly line literature involves two problems: balancing and model sequencing. The general tendency in current studies is to deal with these problems in different time frames. However, in today's competitive market, the mixed model assembly line balancing problem has been turned into an operational problem. In this paper, we propose mixed integer programming (MIP) and constraint programming (CP) models which consider both balancing and model sequencing within the same formulation along with the optimal schedule of tasks at a station. Furthermore, we also compare the proposed exact models with decomposition schemes developed for solving different instances of varying sizes. This is the first paper in the literature which takes into account the network type precedence diagrams and limited buffer capacities between stations. Besides, it is the first study that CP method is applied to balancing and scheduling of mixed model assembly lines. Our empirical study shows that the CP approach outperforms the MIP approach as well as the decomposition schemes.