In the job shop scheduling problem (JSP), a set of N jobs = {J1, J2, . . . , JN} is to be processed on a set of m machines M = {1, 2, . . . ,m}. Each job requires a sequence of operations that must be accomplished according to its manufacturing process Ji = {Oi1, Oi2, . . . , Oim}. Operation Oij requires a processing time of pij time units on machine Mij ∈ M . Each machine can perform at most o...

The article is centred on software system development for manufacturing company that produces polyethylene bags using mostly conventional machines in a competitive world where each business enterprise desires to stand tall. This is meant to assist in gaining market shares, taking maintenance and production decisions by the dynamism and flexibilities embedded in the package as customers’ demand ...

Competitiveness and rapid expansion of flexible manufacturing system (FMS), as one of the industrial alternatives, has attracted the attention of many practitioners and academicians. Globalization has further encouraged FMS development into distributed, self-reliant units of production center. Flexible manufacturing system in distributed system (FMSDS) considers multi-factory environments, wher...

Prediction of the production rate of the cutting dimensional stone process is crucial, especially when chain saw machines are used. The cutting dimensional rock process is generally a complex issue with numerous effective factors including variable and unreliable conditions of the rocks and cutting machines. The Group Method of Data Handling (GMDH) type of neural network and Radial Basis Functi...

The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the constraints or both are usually not available in closed-form, making the problem even harder. A good approximation for the performance measures is thus essential for a successful buffer allocation algorithm. A recently p...

Integrating flexible job-shop scheduling problem (FJSP) with preventive maintenance (PM) is pondered in this paper. Minimizing the makespan for scheduling part and minimizing the system unavailability for maintenance part are simultaneously under consideration. For doing it, the assignment of n jobs on m machines in production side and executing the PM actions at appropriate time intervals in m...

In this paper we present an online method for managing a goaloriented buffer partitioning in the distributed memory of a network of workstations. Our algorithm implements a feedback mechanism which dynamically changes the sizes of dedicated buffer areas and thereby the buffer hit rate for the different classes in such a way that user-specified response time goals are satisfied. The aggregated s...