Purpose of this paper is to analyse and compare the behavior of workload control models in flow shops of both the MTO (Make-To-Order) and MTS (Make-To-Stock) classes. A simulation model has been built, where a manufacturing cell is loaded through an input control mechanism with shop orders coming from a “pool”. The “pool” itself is fed with planned orders coming from an MRP system. The MRP syst...

We consider two generalizations of the proportionate flow shop scheduling problem with the makespan objective. Each job has a processing requirement and each machine has a characteristic value. In our first (second) case we assume that the time a job occupies a machine is the maximum (minimum) of the processing requirement of the job and the characteristic value of the machine. We show that the...

In production processes, just-in-time (JIT) completion of jobs helps reduce both the inventory and late delivery of finished products. Previous research which aims to achieve JIT job completion mainly worked on static scheduling problems, in which all jobs are available from time zero or the available time of each job is known beforehand. In contrast, dynamic scheduling problems which involve c...

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

Makespan minimization in permutation flow-shop scheduling is a well-known hard combinatorial optimization problem. Among the 120 standard benchmark instances proposed by E. Taillard 1993, 23 have remained unsolved for almost three decades. In this paper, we present our attempts to solve these optimality using parallel Branch-and-Bound (BB) on GPU-accelerated Jean Zay supercomputer. We report ex...

In flow shop scheduling there are m machines and n jobs, such that every job has to be processed on the machines in the fixed order 1, . . . , m. In the permutation flow shop problem, it is also required that each machine processes the set of all jobs in the same order. Formally, given n jobs along with their processing times on each machine, the goal is to compute a single permutation of the j...

In this paper, we develop the control rules for job shop scheduling based on the Flow Rate Control model. We derive optimal control results for job shops with work station in series (transfer line). We use these results to derive rules which are suboptimal, robust against random events, and easy to implement and expand.

Requiring only minimal assumptions for validity, nonparametric permutation testing provides a flexible and intuitive methodology for the statistical analysis of data from functional neuroimaging experiments, at some computational expense. Introduced into the functional neuroimaging literature by Holmes et al. ([1996]: J Cereb Blood Flow Metab 16:7-22), the permutation approach readily accounts ...

by a quasi-permutation matrix we mean a square matrix over the complex field c with non-negative integral trace. thus, every permutation matrix over c is a quasipermutation matrix. for a given finite group g, let p(g) denote the minimal degree of a faithful permutation representation of g (or of a faithful representation of g by permutation matrices), let q(g) denote the minimal degree of a fai...

As a communication link between suburban and urban roads, terminals prevent buses from entering the cities, thus, they play an important role in improving traffic flow, reducing urban environmental pollution. Clearly, proximity of te rminals to cities will bring about environmental pollution in different forms (soil, water, air and wastewater). The current study tries to investigate the environ...