This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...

Key British scientists were invited to a 'power' breakfast last month to discuss with no less than five ministers their views on how science policy can be developed. And in the chancellor's later annual budget statement, the government underlined its wish to see investment in science as a key to future prosperity. But future money will not all be coming from the government: there are growing ef...

Lean Production is one of the current issues in logistics (Womack, 2004). Clocked production and transport effect an adjustment of the individual process steps. Today only large companies are able to raise enough transport volume for an individual transport solution and so assure the resulting advantages of decreasing storage costs and capital lockup. An individually clocked transport in small ...

This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...

A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...

asimulation-optimization approach is proposed for replenishment planning andshelf space allocation. the customers’ demand is divided into fixed andvariable demand. each customer follows a given path while shopping in thestore. by dividing the store space into several zones and calculating therelated substantial and random utilities, an analytical equation is proposedfor the probability of zone ...

This paper proposes a novel, bi-objective mixed-integer mathematical programming for an open shop scheduling problem (OSSP) that minimizes the mean tardiness and the mean completion time. To obtain the efficient (Pareto-optimal) solutions, a fuzzy multi-objective decision making (fuzzy MODM) approach is applied. By the use of this approach, the related auxiliary single objective formulation can...

The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, with the objective of minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard and research has focused on heuristics to solve large instances of the problem. In this paper we present four scatter search algorithms to solve large sized S...

We investigated the formation and evolution of CDM subhalos in galaxy-sized and cluster-sized halos by means of N -body simulations. Our aim is to make clear what the “dwarf galaxy problem” is. It has been argued that the number of subhalos in simulated galaxy-sized halos is too large compared to the observed number of dwarfs in the local group, while that in cluster-sized halos is consistent w...

This study addressed warehouse storage location assignment problems (SLAP) to minimize total travelling distances in an order-picking process. The problem was formulated and presented as a mixed integer programming model. The LINGO optimization solver was then used to find solutions for a set of generated problems. The results showed that the LINGO optimization solver easily attained optimal so...