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...

Cellular manufacturing emerged as a production strategy capable of solving the problems of complexity and long manufacturing lead times in batch production. The fundamental problem in cellular manufacturing is the formation of product families and machine cells. This paper presents a new approach for obtaining simultaneous arrangement of part families and machine cells for cellular manufacturin...

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...

Background The traditional concept of family in India to provide support to the elderly is changing soon with disintegration of joint families. In this scenario the concept of old age homes (OAHs) is gaining momentum and the number of people seeking OAH care is rapidly increasing. However, not much is known about the quality of life (QOL) of Indian elderly staying in the OAH setup. Objectives...