We study the problem of scheduling a chain-reentrant shop, in which each job goes for its processing first to a machine called the primary machine, then to a number of other machines in a fixed sequence, and finally back to the primary machine for its last operation. The problem is to schedule...

The scheduling problem has always been considered one of the most complex problems to solve. Most scheduling problems can not be solved optimally within a reasonable period of time. The purpose of this paper is to clarify the production scheduling problem by trying to structure the different...

We study the question of scheduling impatient customers in parallel server queuing systems. At the time of arrival, customers can be identified as one of many classes, where the class represents the service time and patience time distributions, and cost characteristics. From the system's...