Experimental Platform for Collaborative Inter and Intra Cellular Fuzzy Scheduling in an Ubiquitous Manufacturing System

2015 10th Iberian Conference on Information Systems and Technologies (CISTI)

Madureira

2015

Developments in advanced autonomous production resources have increased the interest in the Single-Machine Scheduling Problem (SMSP). Until now, researchers used SMSP with little to no practical application in industry, but with the introduction of multi-purpose machines, able of executing an entire task, such as 3D Printers, replacing extensive production chains, single-machine problems are becoming a central point of interest in real-world scheduling. In this paper we study how simple, easy to implement, Just-in-Time (JIT) based, constructive heuristics, can be used to optimize customer and enterprise oriented performance measures. Customer oriented performance measures are mainly related to the accomplishment of due dates while enterprise-oriented ones typically consider other timeoriented measures.

Section: B Neighbourhood Search Techniques (Nst)mentioning

confidence: 99%

Section: Scheduling Optimization Approaches and Algorithmsmentioning

confidence: 99%

Scheduling single-machine problem oriented by Just-in-Time principles — A case study

Dantas

2015 10th Iberian Conference on Information Systems and Technologies (CISTI)

Madureira

2015

“…In Varela et al [11] a web based system for technologies integration for supporting distributed scheduling in a Virtual Enterprise, by combining a simulation-based approach, with the Hungarian algorithm, for solving job-shop scheduling problems is presented, in order to show how users can benefit from this technologies integration for supporting collaborative distributed or networked manufacturing scheduling. Moreover, dynamic scheduling also does occur in NE and has been solved using different kind of approaches and techniques, such as: heuristics, meta-heuristics, knowledge-based systems, fuzzy logic, neural networks, Petri nets, hybrid techniques, simulation, web-based decision support systems, multi-agent systems and other approaches and decision models [12][13][14][15][16][17][18][19].…”

Section: Scheduling In Netwoked Environmentsmentioning

confidence: 99%

Scheduling and batching in multi-site flexible flow shop environments

Santos

Madureira

2015 10th Iberian Conference on Information Systems and Technologies (CISTI)

et al. 2015

Global competition and the customers demand for customized products with shorter due dates, marked the introduction of the Extended Enterprise. In this Extended Manufacturing Environment (EME), lean, virtual, networked and distributed enterprises collaborate to respond to the market demands. In this paper we study the influence of the batch size on Flexible Flow Shop makespan minimization problem FF C ||C max for two multi-sites approaches, the FSBF (Flow Shop Based Factories) and the PMBF (Parallel-Machines Based Factories). The computational study demonstrates how the performance of the PMBF model decreases with the increase of batch size and determines the batch sizes in which the performance is similar.

“…Therefore, production scheduling means allocation of tasks to resources and sequencing them, in some time interval or instant. However, for carr ying out the allocation and sequencing of tasks successfully, implies to verify all the production conditions [1] and there are many interesting systems, namely web-based systems available for supporting production scheduling [2][3][4][5][6][7].…”

Section: Introductionmentioning

confidence: 99%

Comparative analysis of scheduling rules through arena for parallel machines

Teixeira

Oliveira

2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC 2014)

2014

This study aims to determinate which scheduling rule should be applied, for minimizing the makespan value, and maximizing the utilization level of a production system, which includes a set of three parallel processors, each one integrating five machines, by using a simulation approach based on Arena. A first simulation was done under random conditions, not attending to any kind of rule, and after some dispatching rules were applied, namely the shortest queue rule; the shortest processing time rule; the longest processing time rule; and combination of rules through a weighted sum about completion times and the work in process. A comparative analysis about the application of these rules is carried out in this paper. The rules that have been applied to achieve the goals were selected taking into account not only the problem to be studied, but also different conditions present in a real production system environment. The problem consists on a complex and dynamic system, where each job has the same priority and different processing times, without preemption.