Abstract In this Paper a multi item EOQ model with stock dependent demand for deteriorating items is considered in fuzzy environment. Inventory costs such as holding cost and setup cost have been represented by exponential membership function and profit, deteriorating rate and total investment constraint are represented by linear membership functions. The model has been solved by fuzzy non-line...

[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...

Abstract In this paper, an identical parallel machine scheduling problem with step-deteriorating jobs is considered to minimize the weighted sum of tardiness cost and extra energy consumption cost. particular, actual processing time a job assumed be step function its starting deteriorating threshold. When later than threshold, faces two choices: (1) maintaining status in holding equipment being...

We consider a scheduling rule called MBPS, the mean bounded priority scheduling, which prioritizes jobs by an index computed for each job as a weighed sum of the proportion of time it has been processed and the proportion of time it has been waiting for processing. Proof that MBPS is a deteriorating or a delaying jobs single-machine scheduling problems is given. Two expressions of this dynamic ...

A new unrelated parallel machine scheduling problem with deteriorating 26 effect and the objective of makespan minimization is presented in this paper. The 27 deterioration of each machine (and therefore of the job processing times) is a function of the 28 sequence of jobs that have been processed by the machine and not (as considered in the 29 literature) by the time at which each job is assig...

This paper considers a two-machine flow shop scheduling problem with deteriorating jobs in which the processing times of jobs are dependent on their starting times in the sequence. The objective is to minimize the weighted sum of makespan and total completion time. To analyse the problem, we propose a mixed integer programming model, and discuss several polynomially solvable special cases. We a...

In this study we examine scheduling a set of deteriorating jobs on a single processor. We propose a model which reflects real life situations in which the processing time of jobs increases or decreases depending on its initial processing time and other activities such as maintenance or repair of machine, break for workers, etc. Since we assume workers as processors in our study, a rate modifyin...

This paper considers two scheduling problems for a two-machine flowshop where a single machine is followed by a batching machine. The first problem is that there is a transporter to carry the jobs between machines. The second problem is that there are deteriorating jobs to be processed on the single machine. For the first problem with minimizing the makespan, we formulate it as a mixed integer ...