This paper explores selected heuristics methods, namely CDS, Palmer’s slope index, Gupta’s algorithm, and concurrent heuristic algorithm for minimizing the makespan in permutation flow shop scheduling problem. Its main scope is to explore how different instances sizes impact on performance variability. The computational experiment includes 12 of available benchmark data sets of 10 problems proposed by Taillard. The results are computed and presented in the form of relative percentage deviation, while outputs of the NEH algorithm were used as reference solutions for comparison purposes. Finally, pertinent findings are commented.
The article presents a study on the effectiveness of the foundries using Data Envelopment Analysis (DEA) method. The aim of the article is to analyze the usefulness of DEA method in the study of the relative efficiency of the foundries. DEA is a benchmarking technique based on linear programming to evaluate the effectiveness of the analyzed objects. The research was conducted in four Polish and two foreign plants. Evaluated foundries work in similar markets and have similar production technology. We created a DEA model with two inputs (fixed assets and employment) and one output (operating profit). The model was produced and solved using Microsoft Excel together with its Solver add-in. Moreover, we wrote a short VBA script to perform automating calculations. The results of our study include a benchmark and foundries’ ranking, and directions to improve the efficiency of inefficient units. Our research has shown that DEA can be a very valuable method for evaluating the efficiency of foundries.