This paper considers identical parallel machines scheduling problem with past-sequence-dependent setup times, deteriorating jobs and learning effects, in which the actual processing time of a job on each machine is given as a function of the processing times of the jobs already processed and its scheduled position on the corresponding machine. In addition, the setup time of a job on each machin...

In this paper, we consider the problem of scheduling jobs on parallel machines with setup times. The setup has to be performed by a single server. The objective is to minimize the schedule length (makespan), ss well as the forced idle time. The makespan problem is known to be NP-hard even for the csse of two identical parallel machines. This paper presents a pseudopolynomial algorithm for the c...

This study investigates the single-machine scheduling problem with common due-win -dow assignment, past-sequence-dependent (p-s-d) setup times and a deteriorating maintenance activity. By past-sequence-dependent setup times, we mean that the setup time of a job is proportional to the sum of the processing times of the jobs already processed. The objective is to minimize a cost function based on...

The job shop scheduling problem is a combinatorial optimization problem and one of the most complex problems among various production scheduling problems. The present work assesses the effect of change in setup time’s levels on mean flow time and means tardiness measures. The simulation model of the job shop is developed for investigation purpose. Three levels of setup times i.e. SUL_1, SUL_2 a...