Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

Flow shop sequencing problem is included in NP-hard problems and a number of heuristic methods have been developed to solve it. Most of these methods are offered for the crisp processing time. However fuzzy algorithm is appropriate for the problems with fuzzy processing time. This paper presents a method in which an algorithm is used to minimize make span of flow shop with fuzzy processing time...

In this article we present an Ant Colony Optimization approach to the Flow Shop Problem. ACO is a new algorithmic approach, inspired by the foraging behavior of real ants, that can be applied to the solution of combinatorial optimization problems. Artificial ants are used to construct solutions for Flow Shop Problems that subsequently are improved by a local search procedure. Comparisons with o...

In this paper we study specially structured two stage flow shop scheduling problem with jobs in a string of disjoint job blocks having sequence independent setup times separated from processing times each associated with their respective probabilities including job weightage. In flow shop scheduling optimization of elapsed time may not always result in optimization of utilization time. Here, th...

Abstract: We develop a constant-inventory tactical planning model for a generic manufacturing system, such as a job shop. The model is based on a discrete-time, continuous flow model developed by the first author. In the model, we assume that we can regulate the release of work to the shop to maintain the constant-inventory constraint. We characterize the conditions for which the shop productio...

Abstract Digital Twin (DT) is considered a key approach to enhance the system reactivity uncertain events due its ability getting data from field and triggering actions on physical asset. Given modern technological rapidly changing work environment, it likely that in next years companies will need retrofit their manufacturing systems by integrating DTs. In this context, fundamental define neces...

SOMMARIO/ABSTRACT In this paper we report on the extension of the classical HTN planner SHOP to plan in partially observable domains with uncertainty. Our algorithm PC-SHOP uses belief states to handle situations involving incomplete and uncertain information about the state of the world. Sensing and acting are integrated in the primitive actions through the use of a stochastic model. PC-SHOP i...

Drum-Buffer-Rope-based production planning and control (PPC) approaches provide production managers with effective tools to manage production disruptions and improve operational performance. The corner stone of these approaches is the proper selection of time-buffers which are considered as exogenously defined constant. However, the majority of real-world manufacturing systems are characterized...

We implement a simple two-shop search model in the laboratory with the aim to investigate if consumers behave differently in equivalent situations, where prices are displayed either as net prices or as gross prices with discounts . We compare treatments, where we either depict the known price of the first shop or the initially uncertain price of the second shop as a gross price with a discount,...