In this paper, an purchasing inventory model for deteriorating items is developed with a linear, positive trend in demand, allowing inventory shortages and backlogging. It is assumed that the goods in the inventory deteriorate over time at a constant rate . Two models are developed for two operational policies. The first policy covers the case that the inventory model with linear demand for det...

A block iterative method is used for solving linear least squares problems. The subproblems are solved asynchronously on a distributed memory multiprocessor. It is observed that an increased number of processors results in deteriorating rate of convergence. This deteriorating convergence is illustrated by numerical experiments. The deterioration of the convergence can be explained by contaminat...

nowadays, scheduling problems have a considerable application in production and service systems. in this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. in many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinat...

In the last decades, availability constraint as well learning and deteriorating effects were introduced into production scheduling theory to simulate real-world case studies overcome limitation of classical models. To best our knowledge, this paper is first in literature address permutation flowshop problem (PFSP) with flexible maintenance under deterioration minimize makespan. Firstly, we PFSP...

Multi-objective inventory models of deteriorating items have been developed with vague and imprecise information about available storage area. Here, the objectives are (i) to maximize the profit, (ii) to minimize the wastage cost due to deterioration and (iii) to minimize the total production cost. These objectives are also fuzzy in nature. In these models, production rate is a decision variabl...

We use logic-based Benders decomposition to minimize tardiness in single-facility scheduling problems with many jobs and long time horizons. Release dates and due dates are given. A mixed integer linear programming (MILP) based master problem allocates jobs to segments of the time horizon, and a constraint programming (CP) based subproblem schedules the jobs in each segment.

recently, two of the authors have introduced the collapse capacity spectrummethodology, which allows the assessment of the collapse capacity of highly inelastic p-deltasensitive regular frame structures without performing non-linear time-history analyses. the mainingredient of this method is the collapse capacity spectrum, which represents the seismic collapsecapacity of an inelastic non-deteri...

 This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...