Andrzej Jardzioch

Job Scheduling Problem in a Flow Shop System with Simulated Hardening Algorithm

A solution to the problem of job scheduling in a flow shop system is proposed in this paper. A three-machine flow shop system is presented with 10 sets of 10 random jobs to be processed. A new approach, called Simulated Hardening (SH), is used to schedule the jobs by taking into consideration two criteria: minimal makespan and maximal profit. The results obtained are compared with First In First Out (FIFO), Earliest Due Date (EDD), Shortest Processing Time (SPT), Longest Processing Time (LPT), Time Reserve (TR), and Descending Delay Penalty (DDP) sorting methods and confronted with the results of exhaustive search. The usefulness of the new SH algorithm is estimated in terms of the quality of the results obtained.

Modelling and Performance Evaluation of Fractal Topology Streets Network

The paper introduces the concept of a Fractal Topology Streets Network (FTSN) in which different transportation modes interact each other via distinguished subsets of common shared hubs as to provide a variety of mass customized passenger services. The network of repetitively acting local transportation modes encompassing FTSN’s fractal structure provides a framework for passengers’ origin-destination trip routing and scheduling. The passenger travel schedules can be estimated easily while taking into account cyclic behaviour of both: local transportation modes and the whole transportation network. In that context the paper’s objective concerns of assessment of a Fractal-like Network of periodically acting Local Transportation Modes (FNLTM) infrastructure from the perspective of possible mass-customized oriented requirements.

MODELING OF HIGH STORAGE SHEET DEPOT WITH PLANT SIMULATION

Manufacturing processes are becoming increasingly automated. Introduction of innovative solutions often necessitate processing very large number of signals from various devices. Correctness tests of the components configuration becomes a compiled operation requiring vast expenditure of time and knowledge. The models may be a mathematical reflection of the actual object. Many actions can be computer-assisted to varying degree. One example is construction of simulation models. These can also be simulation models developed in advanced software. The stages of creating a model may be purely random. This paper aims at a closer analysis of the simulation model based on the high storage sheet depot modeling using Plant Simulation software. The results of analysis can be used for optimization, but this stage is a separate issue.

Selected Aspects of Crossover and Mutation of Binary Rules in the Context of Machine Learning

The study focuses on two operators of a genetic algorithm (GA): a crossover and a mutation in the context of machine learning of fuzzy logic rules. A decision support system (DSS) is placed in a simulation environment created in accordance with the complex adaptive system (CAS) concept. In a multi-agent CAS system, the learning classifier system (LCS) paradigm is used to develop a learning system. The aim of the learning system is to discover binary rules that allow an agent to perform efficient actions in a simulation environment. The agent’s objective is to make an effective decision on which order, from the set of the awaiting orders, should be transferred into a production zone next. The decision is based on the fuzzy logic system response. In the conducted study, two input signals and one output signal of the fuzzy logic system are considered. The concept of the presented fuzzy logic system affects the construction of rules of a specific agent. The paper focuses on the problem of coding the agent’s rules and modification of the coding by the GA.

Minimization of Delay Costs in the Realization of Production Orders in Two-Machine System

Abstract The article presents a new algorithm that enables the allocation of the optimal scheduling of the production orders in the two-machine system based on the minimum cost of order delays. The formulated algorithm uses the method of branch and bounds and it is a particular generalisation of the algorithm enabling for the determination of the sequence of the production orders with the minimal sum of the delays. In order to illustrate the proposed algorithm in the best way, the article contains examples accompanied by the graphical trees of solutions. The research analysing the utility of the said algorithm was conducted. The achieved results proved the usefulness of the proposed algorithm when applied to scheduling of orders. The formulated algorithm was implemented in the Matlab programme. In addition, the studies for different sets of production orders were conducted.