This paper presents an experimental investigation of the Sounds of Silence (SoS) harmony search metaheuristic for the multi-mode resource-constrained project scheduling problem (MRCPSP) using a pre-optimized starting repertoire. The presented algorithm is based on the time oriented version of the SoS harmony search metaheuristic developed by Csébfalvi et al. [1] for the single-mode resource-con...

dynamic cellular manufacturing systems,   mixed-integer non-linear programming,   production planning, manufacturing attributes   this paper presents a novel mixed-integer non-linear programming model for the design of a dynamic cellular manufacturing system (dcms) based on production planning (pp) decisions and several manufacturing attributes. such an integrated dcms model with an extensive c...

data envelopment analysis (dea) has been widely studied in the literature since its inception with charnes, cooper and rhodes work in 1978. the methodology behind the classical dea method is to determine how much improvements in the outputs (inputs) dimensions is necessary in order to render them efficient. one of the underlying assumptions of this methodology is that the units consume and prod...

although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. this paper deals with scheduling jobs in lot streaming flexible flow line problems. the paper mathematically formulates the problem by a mixed integer linear programming model. this model solves small instances to optimality. moreo...

Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...

We study the mixed-integer rounding (MIR) closures of polyhedral sets. The MIR closure of a polyhedral set is equal to its split closure and the associated separation problem is NP-hard. We describe a mixed-integer programming (MIP) model with linear constraints and a non-linear objective for separating an arbitrary point from the MIR closure of a given mixed-integer set. We linearize the objec...

A three-level relief chain including a number of suppliers in fixed locations, candidate distribution centers and affected areas at certain points are considered. A mixed integer nonlinear programming model is proposed for open transportation location routing problem by considering split delivery of demand. To solve a realistic problem, foregoing parameters are considered as fuzzy in our propos...

in this paper, a mathematical method is proposed to formulate a generalized ordering problem. this model is formed as a linear optimization model in which some variables are binary. the constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. on the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...

Computing the exact ideal and nadir criterion values is a very ‎important subject in ‎multi-‎objective linear programming (MOLP) ‎problems‎‎. In fact‎, ‎these values define the ideal and nadir points as lower and ‎upper bounds on the nondominated points‎. ‎Whereas determining the ‎ideal point is an easy work‎, ‎because it is equivalent to optimize a ‎convex function (linear function) over a con...