In this paper, a nonconvex multiobjective optimization problem with Lipschitz objective functions is considered. A branch and bound algorithm that incorporates the decision maker’s preference information proposed for problem. algorithm, new discarding test designed to check whether box contains preferred solutions according expressed by means of reference points. way, able gradually guide searc...

In the realm of scheduling problems, different sources of uncertainty such as probabilistic durations of jobs or stochastic breakdowns of machines can arise. Given this, one highly desirable characteristic of an intelligent schedule is to bring better punctuality with less efficiency-loss because a dominant factor in customer appreciation is punctuality. It is also one of the most intangible to...

Cellular manufacturing system (CMS) is highly important in modern manufacturing methods. Given the ever increasing market competition in terms of time and cost of manufacturing, we need models to decrease the cost and time of manufacturing. In this study, CMS is considered in condition of dynamic demand in each period. The model is developed for facing dynamic demand that increases the cost of ...

In this article we first review previous integer formulations for the maximum diversity problem. This problem consists of selecting a subset of elements from a data set in such a way that the sum of the distances between the chosen elements is maximized. We propose a branch and bound algorithm and expressions for upper bounds for this problem. As far as we know, this is the first exact algorith...