We introduce the multiple capacitated job shop scheduling problem as a generalization of the job shop scheduling problem. In this problem machines may process several operations simultaneously. We present an algorithm based on constraint satisfaction techniques to handle the problem e ectively. The most important novel feature of our algorithm is the consistency checking. An empirical performan...

This paper presents a state of the art overview on Ants Systems. Initially the work proposes the fundamental concepts of Ants Theory and offers a description of the main algorithms (based on Ants Theory) and the respective fields of application. Among different fields of application, the paper focuses on industrial plants scheduling problems in open shop, flow shop and job shop systems. The las...

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

Scheduling problems in an open shop is more complicated than others since jobs do not follow a certain route in the system. This study uses computer simulation to compare the performance of different dispatching rules in an open shop. We find that the choice of the best dispatching rule is affected by the utilization factor, due-date factors, and the process time distribution at each station. I...

Nowadays, the enterprises outsource components to others, but they have not full control about delivery times, neither about components quality or defined specifications inspection during their production, because they have no remote monitoring or controlling services available in the others shop floor enterprises, even in enterprises of the same group. Moreover, when their shop floor resources...

In shop scheduling, several applications exist where it is required that some components perform consecutively. We refer to no-idle schedules if machines are required to operate with no inserted idle time and no-wait schedules if tasks cannot wait between the end of an operation and the start of the following one. We consider here no-idle/no-wait shop scheduling problems with makespan as perfor...

Consumer behaviour in 2016 shows that (r)etailers need online/offline integration to better serve their clients. An important distinguishing feature of the physical shop is how it can offer consumers a shopping experience. This study uses two experiments to research the extent a fashion store's shopping experience can be presented to consumers via visual material (a regular photo, a 360-degree ...

A scheduling system is proposed and developed for a special type of flow shop. In this flow shop there is one machine at each stage. A job may require multiple operations at each stage. The first operation of a job on stage j cannot start until the last operation of the job on stage j-1 has finished. Preemption of the operations of a job is not allowed. The flow shop that we consider has anothe...

SHOP (Simple Hierarchical Ordered Planner) is a domain-independent H T N planning system with the following characteristics. • SHOP plans for tasks in the same order that they will later be executed. This avoids some goalinteraction issues that arise in other HTN planners, so that the planning algorithm is relatively simple. • Since SHOP knows the complete world-state at each step of the planni...

In this article, we consider the minimization of the total tardiness in a flexible job-shop. In our knowledge, this criterion is not previously studied for this type of shop configuration. The total tardiness criterion was mainly considered in the single machine problem (Chu [Chu92] and Souissi et al. [SKC04]). Few references studied this criterion in a job-shop configuration. The priority rule...