This paper demonstrates solving the flexible flow shop scheduling problem (FFSP) with considering limited waiting time constraint, sequence dependent setup times and different ready time to minimize maximum completion time (i.e. makespan). Since the problem studied is NP-hard, metaheuristic algorithms are proper to solve this class of problems. Hence, in this 1 / 4

in this paper, a production inventory model is developed for the business enterprise which consists of three wings. the first wing is for manufacturing new items, the second wing is for collecting the returned items, while third wing is for remanufacturing the returned item. in this model we consider the fact that the storage item is deteriorated during storage periods and salvage value is inco...

cervical cancer is the third most common cancer among women in malaysia. the objective of this study was to estimate the effect of explanatory variables on survival time of cervical cancer patients receiving treatment at a hospital in malaysia.in this retrospective record review study, cervical cancer data obtained from hospital universitisains malaysia (husm) was analysed. the data comprises o...

In this paper, a bulk arrival general bulk service queueing model delayed service with restricted vacation policy, variant arrival rate and setup time is considered. The server starts the service only if at least ‘a’ customers are waiting in the queue, and renders the service according to the general bulk service rule with minimum of ‘a’ customers and maximum of ‘b’ customers, then the server w...

This paper addresses an unrelated multi-machine scheduling problem with sequence-dependent setup time, release date and processing set restriction to minimize the sum of weighted earliness/tardiness penalties and the sum of completion times, which is known to be NP-hard. A Mixed Integer Programming (MIP) model is proposed to formulate the considered multi-criteria problem. Also, to solve the mo...

We consider an open shop scheduling problem with setup and processing times separately such that not only the setup times are dependent on the machines, but also they are dependent on the sequence of jobs that should be processed on a machine. A novel bi-objective mathematical programming is designed in order to minimize the total tardiness and the makespan. Among several mult...