• 대한산업공학회지
• /
• 제35권4호
• /
• pp.257-265
• /
• 2009

This paper considers the hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. In hybrid flow shops, each job is processed through multiple production stages in series, each of which has multiple identical parallel machines. The problem is to determine the allocation of jobs to the parallel machines at each stage as well as the sequence of the jobs assigned to each machine. Due to the complexity of the problem, we suggest search heuristics, tabu search and simulated annealing algorithms with a new method to generate neighborhood solutions. In particular, to evaluate and select neighborhood solutions, three surrogate objectives are additionally suggested because not much difference in the number of tardy jobs can be found among the neighborhoods. To test the performances of the surrogate objective based search heuristics, computational experiments were performed on a number of test instances and the results show that the surrogate objective based search heuristics were better than the original ones. Also, they gave the optimal solutions for most small-size test instances.

• 경영과학
• /
• 제17권1호
• /
• pp.41-54
• /
• 2000

in the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1993년도 추계학술대회발표논문집; 서강대학교, 서울; 25 Sep. 1993
• /
• pp.10-10
• /
• 1993

본 연구에서는 다품종(multiple products) 다단계(multi-stage) 흐름 생산시스템에서의 제품별 로트 투입순서결정무제를 다루었다. 다단계 흐름 생산시스템의 투입순서 결정문제에 대한 기존연구는 각 단계의 기계대수가 1대인 경우에 관한 것이 대부분이지만, 본 연구에서는 각 단계의 기계대수가 복수이고 각 제품의 생산량이 로트로 주어지며, 또한 각 단계마다의 이송이 로트로 이루어지는 것이 아니라 1단위로 이루어지는 생산시스템을 대상으로 하였다. 그리고 각 제품의 생산준비기간은 투입순서와 관계 없이 일정하며 앞 단계에서 제품이 도착하지 않더라도 생산준비는 먼저 수행될 수 있다고 가정하였다. 제품별 로트 투입순서 결정문제에서 사용된 성능평가기준(performance measure)은 총작업소요시간(makespan)이며 순열투입순서(permutation schedule)만을 대상으로 하였다. 결정기법으로는 투입순서 결정문제에서 효율적인 것으로 알려져 있는 분지한계법(Branch & Bound)이 사용되었으며 분지한계법에서 이용되는 부분투입순서(partial sequence)에 대한 하한값(lower bound)을 제시하였다. 제시된 기법을 사용하면 현실적인 크기의 제품별 로트 투입순서 결정문제를 적당한 시간내에 충분히 해결할 수 있을 것으로 보인다. 제시된 해법으로 해결된 수치예제가 주어져 있다.

• Management Science and Financial Engineering
• /
• 제9권2호
• /
• pp.47-68
• /
• 2003

We consider the customer order scheduling problem with job capacity restriction where the number of jobs in the shop at the same time is fixed. In the customer order scheduling problem, each job is part of some batch (customer order) and the composition of the jobs (product) in the batch is pre-specified. The objective function is associated with the completion time of the batches instead of the completion time of the jobs. We first summarize the known results for the general customer order scheduling problems. Then, we establish some new properties for the problems with job capacity restriction. For the case of unit processing time with the objective of minimizing makespan, we develop a polynomial-time optimal procedure for the two machine case. For the same problem with a variation of no batch alternation, we also develop a polynomial-time optimal procedure. Then, we show that the problems with the objectives of minimizing makespan and minimizing average batch completion time become NP-hard when there exist arbitrary number of machines. Finally, We propose optimal solution procedures for some special cases.

• 한국경영과학회지
• /
• 제17권1호
• /
• pp.41-41
• /
• 1992

In the real world situations that some jobs need be processed only on certain limited machines frequently occur due to the capacity restrictions of machines such as tools fixtures or material handling equipment. In this paper we consider n-job non-preemptive and m parallel machines scheduling problem having two machines group. The objective function is to minimize the sum of earliness and tardiness with different release times and due dates. The problem is formulated as a mixed integer programming problem. The problem is proved to be Np-complete. Thus a heuristic is developed to solve this problem. To illustrate its suitability and efficiency a proposed heuristic is compared with a genetic algorithm and tabu search for a large number of randomly generated test problems in ship engine assembly shop. Through the experimental results it is showed that the proposed algorithm yields good solutions efficiently.