A bottleneck machine identification algorithm is proposed for the job shop scheduling problem to minimize total tardiness. The scheduling policies for bottleneck machines can have significant impact on the final solution quality and therefore they need to be optimized with more computational effort. In order to detect these bottleneck machines prior to solving the original problem, an optimizat...

We survey solution methods for the job shop scheduling problem with an emphasis on local search. Both deterministic and randomized local search methods as well as the proposed neighborhoods are discussed. We compare the computational performance of the various methods in terms of their eeectiveness and eeciency on a standard set of problem instances. In the job shop scheduling problem we are gi...

Many real-world scheduling problems are solved to obtain optimal solutions in term of processing time, cost and quality as optimization objectives. Currently, energy-efficiency is also taking into consideration in these problems. However, this problem is NP-Hard, so many search techniques are not able to obtain a solution in a reasonable time. In this paper, a genetic algorithm is developed to ...

This paper focuses on the study of cyclic job-shop problems with transportation and blocking. Within this domain, there are many real world problems like large scale productions, robotic cells, software pipelining or hoist scheduling. The aim in general is to find, for each machine, a feasible order of all the operations processed on this machine, so that an objective function is optimised. In ...

In most manufacturing and distribution systems, semi-finished jobs are transferred from one processing facility to another by transporters such as Automated Guided Vehicles, robots and conveyors, and finished jobs are delivered to warehouses or customers by vehicles such as trucks. This paper investigates two-machine flow shop scheduling problems taking transportation into account. The finished...

This paper studies the complexity variations of scheduling problems in diierent machine environments when replacing operations with arbitrary processing times by the chains of operations with unit processing times. Special attention is paid to polynomial-time algorithms for chain-like precedence-constrained problems with unit processing times and transformations of their solutions to each other...