This paper presents a new mathematical model for integrated dynamic cellular manufacturing systems and production planning that minimizes machine purchasing, intra-cell material handling, cell reconfiguration and setup costs. The presented model forms the manufacturing cells and determines the quantity of machine and movements  during each period of time. This problem is NP-hard, so a meta-heur...

In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...

A design problem of cross-docking distribution networks is addressed as a new research area in logistics management. This paper presents a new mathematical model for the location of cross-docking facilities and vehicle routing scheduling problems in distribution networks. For this purpose, a two-phase mixed-integer programming (MIP) is formulated. Then, a new heuristic-based simulated annealing...

Background: Adiponectin is an adipocytokines which is secreted from the adipose tissue of human and domestic animals. No information is available regarding the follicular fluid adiponectin concentrations in dairy cows. Therefore, the aim of the present study was to determine the follicular fluid adiponectin concentrations in different-sized follicles in the luteal phase of the estrous cycle in ...

Production scheduling is a part of operational research which relies on combinational optimization solved by discrete methods. This wide area covers different variety of problems like; vehicle routing problem, bin packing problem and job priority. In order to solve these problems, operational research applies two main principles: exact methods which provide the absolute best solution but solve ...

this paper addresses the problem of minimizing the sum of maximum earliness and tardiness on identical parallel machines scheduling problem. each job has a processing time and a due date. since this problem is trying to minimize and diminish the values of earliness and tardiness, the results can be useful for just–in-time production systems. it is shown that the problem is np-hard. using effici...

in this paper, the problem of lot sizing, scheduling and delivery of several items in a two-stage supply chain over a finite planning horizon is studied. single supplier via a flexible flow line production system (ffl) produces several items and delivers them directly to an assembly facility. based on basic period (bp) strategy, a new mixed zero-one nonlinear programming model has been develope...

Bin packing is a well-known NP-Hard optimization problem which has several real applications. Classical bin packing (BPP) is a simple model where all bins are identical. However, the variable sized bin packing problem (VSBPP) is a generalization of the bin packing problem where bins of different capacities are available for packing a set of items having different weights. The objective is to pa...

We analyze the complexity of vote trading problems with equal-sized voting districts. For two allied vote-swapping parties, the problem is polynomially solvable. For three parties, the problem is NP-complete.