Combinatorial optimization problems are usually NP-hard and the solution space of them is very large. Therefore the set of feasible solutions cannot be evaluated one by one. Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) are metaheuristic techniques...

This paper presents an asymptotic analysis of hierarchical production planning in a manufacturing system with two tandem machines that are subject to breakdown and repair. Since the number of parts in the buffer between the two machines needs to be non-negative, the problem is inherently a state...

The optimal production control problem of deterministic pull flow lines with multiple part types is considered in this paper. The last machine is assumed to be the bottleneck. The objective is to minimize the total inventory and backlog costs over time. We give an optimal production policy and...

Flow shop scheduling is common in modern lean production systems. In practice, jobs in flow shops can arrive at irregular times. However, scheduling that considers such irregularity has not been adequately investigated in the literature. In this paper, we examine the scheduling of n-jobs in an...

Specific scheduling problems with complex hybrid logical and terminal constraints, non-stationarity in process execution as well as complex interrelations between dynamics in process design, capacity utilization, and machine setups require further investigation and the application of a broad...

We consider a production planning problem for a general jobshop producing a number of products and subject to breakdown and repair of machines. The machine capacities are modeled as Markov chains. The objective is to choose the rates of production of the final products and intermediate parts on...