Search Results

This paper proposes an exact Constraint Programming (CP) method with an extensive focus on real-world constraints for the Multi-manned Assembly Line Balancing Problem with Assignment Restrictions (MALBP-AR). We perform an in-depth literature ...

• A MALBP with assignment restrictions related to transforming resources is presented.
• Development of an exact and competitive Constraint Programming (CP) model.
• Proposal of the most complete ARALBP model in the literature.
• ...

Production and distribution are both crucial components of supply chains. Integrated production and distribution scheduling (IPDS) in the context of flexible assembly flow shop scheduling and batch delivery problems is often overlooked. A ...

• A RCFAFSP-BDD inspired by a dishwasher plant is studied to fill a gap in the field.
• A MIP mathematical model is designed to formulate RCFAFSP-BDD.
• A new approach based on the constraint programming (CP) is proposed for the problem.

The Multi-Mode Resource-Constrained Multiple Projects Scheduling Problem (MMRCMPSP) is an important combinatorial optimization problem for both real-world situations in industry and academic research. Its objective is to find the best schedule for ...

In this paper we deal with a complex real world scheduling problem closely related to the well-known Resource-Constrained Project Scheduling Problem (RCPSP). The problem concerns industrial test laboratories in which a large number of tests are ...

In sustainable agriculture, intercropping systems represent a valuable approach. These systems involve placing mutually beneficial plant types in close proximity to each other, with the goal of exploiting biodiversity to reduce pesticide and ...

• We study the Crop Planting Layout Problem.
• We perform complexity analysis and use an Artificial Intelligence solving method.
• We present two constraint programming models with integer and interval variables.
• The computational ...

Organizations around the world schedule jobs (programs) regularly to perform various tasks dictated by their end users. With the major movement toward using a cloud computing infrastructure, our organization follows a hybrid approach with both ...

Constraint programming (CP) is a powerful technique for solving constraint satisfaction and optimization problems. In CP solvers, the variable ordering strategy used to select which variable to explore first in the solving process has a ...

• We propose a novel variable ordering strategy based on supervised learning.
• Our proposed method performs competitively when compared to existing methods.
• Hybridizing learning-based methods with domain-based methods is beneficial.

Last-mile delivery problems where trucks and drones collaborate to deliver goods to final customers are considered. We focus on settings where a fleet with several homogeneous trucks work in parallel to collaborative drones, able to combine with ...

We consider the problem of perception-based constraint solving, where part of the problem specification is provided indirectly through an image provided by a user. As a pedagogical example, we use the complete image of a Sudoku grid. While the ...

In recent years, pattern mining has evolved from a slow-moving, repetitive three-step process to a much more agile and iterative/user-centric mining model. A crucial element of this framework is the capability to rapidly provide a set of diverse ...

We study a planning problem based on Plotting, a tile-matching puzzle video game published by Taito in 1989. The objective of this turn-based game is to remove a target number of coloured blocks from a grid by sequentially shooting blocks into the ...

This study addresses the premarshalling problem when the crane time is limited and a complete rearrangement of the bay is not possible. This issue has been neglected in the literature, but it is very common in practice. We show that the use of ...

• We address a novel problem: the premarshalling under limited crane time, CPMP-LCT.
• Computational evidence confirms the interest of the CPMP-LCT in practice.
• A constraint programming model is proposed for solving the CPMP-LCT.
• ...

Over time, power network equipment can face defects and must be maintained to ensure transmission network reliability. Once a piece of equipment is scheduled to be withdrawn from the network, it becomes unavailable and can lead to power outages ...

Security risk assessment is an important challenge in the design of Cyber Physical Systems (CPS). Even more importantly, the intrinsically dynamical nature of these systems, due to changes in their environment, as well as evolutions in their ...

• We propose and implement a framework for self-adaptive security in CPS.
• Our approach involves Security Risk Assessment, taking into account QoS aspects.
• We formalize the on-line decision problem to be solved using Constraint ...

The short-term scheduling of activities in underground mines is an important step in mining operations. This procedure is a challenging optimization problem since it deals with many resources and activities conducted in a confined working space. ...

We address a real-world scheduling problem where the objective is to allocate a set of tasks to a set of machines and to a set of workers in such a way that the total weighted tardiness is minimized. Our case study encompasses four types of ...

• A real-world problem that includes a new concept of contiguity is studied.
• Methods using integer/constraint programming & Benders’ decomposition are proposed.
• A heterogeneous dataset is used to evaluate the performance of the ...

We consider the discrete-time Arrow-Hurwicz-Uzawa primal-dual algorithm, also known as the first-order Lagrangian method, for constrained optimization problems involving a smooth strongly convex cost and smooth convex constraints. We prove that, ...

• Considering a two-echelon network with different shop configurations for factories.
• The factories have hybrid flow shop and flexible job shop configuration.
• Presenting a model to minimize the maximum completion time and ...

Nowadays, many massive factories are forced to distribute their products in several manufacturing units. This issue has caused the emergence of a novel category of problems called distributed production scheduling, which is vital in today's ...

• Human-robot collaboration for synchronised production-logistics in aircraft assembly.

The deployment of human-robot teams (HRTs) promises to realise the potential of each team member regarding their distinct abilities and combines efficiency and flexibility in manufacturing operations. However, enabling effective ...

This paper addresses the scheduling of turnaround operations for flights in civil airports. A series of complex issues, including the heterogeneity of flights and operators, resource constraints on turnaround operations, temporal restrictions and ...

• MILP and CP formulations for the flight ground service scheduling problem.
• Joint consideration of complex features: multi-to-one services, multifunctional operator etc.
• Coverage of uncertainties and relative discussions.
• ...