Jaroslaw Pempera

Learn More
This paper develops and compares di1erent local search algorithms for the no-wait &ow-shop problem with makespan criterion (Cmax). We present several variants of descending search and tabu search algorithms. In the algorithms the multimoves are used that consist in performing several moves simultaneously in a single iteration of algorithm and allow us to(More)
We consider the flow shop scheduling problem with minimizing two criteria simultaneously: the total completion time (makespan) and the sum of tardiness of jobs. The problem is strongly NP-hard, since for each separate criteria the problem is strongly NP-hard. There is a number of heuristic algorithms to solve the flow shop problem with various single(More)
This paper describes two parallel simulated annealing algorithms for the job shop scheduling problem with the sum of job completion times criterion. Some properties of the problem associated with the block theory have been presented and discussed. These properties allow us to introduce the effective neighborhood based on the adjacent swap type moves. In(More)
In this paper we consider an NP -hard hybrid flow shop problem with machine setups and cycletime minimization. The above issue is an important generalization of a flow-shop problem with minimization of a cycle time, and it stays in a direct relationship with a flexible job shop problem. In the hybrid problem task operations are performed by machines(More)
This paper deals with scheduling of tasks in cyclic flexible job shop scheduling problem (CFJSSP). We have proposed a new method of computing cyclic time for CFJSSP. This method is based on the known properties of the job shop problem as well as new properties of cyclic scheduling. We have developed two versions of proposed method: sequential and parallel.(More)