Showing 1 - 10 of 32
We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...
Persistent link: https://www.econbiz.de/10013152472
Scheduling methods are proposed for a class of flexible manufacturing systems consisting of machine centers served by a cyclic conveyor. The minimization of finish time is considered as the optimization criterion. An optimal algorithm is proposed for the minimum conveyor speed (S = 1) for a...
Persistent link: https://www.econbiz.de/10012834910
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...
Persistent link: https://www.econbiz.de/10012835287
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...
Persistent link: https://www.econbiz.de/10012835295
Parallel machine structure is very common in modern production systems. Its performance sometimes has a decisive impact on the whole productivity. In this paper, we consider a parallel-machine scheduling problem where each machine is subject to periodic maintenance. Instead of assuming all the...
Persistent link: https://www.econbiz.de/10012838273
Job shop scheduling with a bank of machines in parallel is important from both theoretical and practical points of review. Here we focus on a flexible job shop scheduling problem of minimizing the makespan in a two-center job shop, where the first center consists of one machine and the second...
Persistent link: https://www.econbiz.de/10012838656
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...
Persistent link: https://www.econbiz.de/10012838801
This paper is concerned with the optimal production planning in a dynamic stochastic manufacturing system consisting of a single machine that is failure prone and facing a constant demand. The objective is to choose the rate of production over time in order to minimize the long-run average cost...
Persistent link: https://www.econbiz.de/10012906229
The paper is concerned with the problem of optimal production planning in deterministic pull flow lines with multiple products. The objective is to specify the production policy that minimizes the total inventory and backlog costs overtime. Assuming constant product demands and non-decreasing...
Persistent link: https://www.econbiz.de/10012772150
We consider the scheduling problem of cyclic production in a bufferless dual-gripper robot cell processing a family of identical parts. The objective is to find an optimal sequence of robot moves so as to maximize the long-run average throughput rate of the cell. While there has been a...
Persistent link: https://www.econbiz.de/10012750229