• 경영과학
• /
• 제21권2호
• /
• pp.79-91
• /
• 2004

In industrial production settings, scheduling problems for detailed day-to-day operations are often ordeals to production practitioners. For those who have scheduling experiences with the Gantt Chart, the job oriented heuristic scheduling has illustrated its merits in solving practically large scale scheduling problems. It schedules all operations of a job within a finite capacity before considering the next job. In this paper, we Introduce the LSB (load smoothing backward) scheduling algorithm for the job oriented heuristic scheduling. Through a computer experiment in a hypothetical setting, we make a performance comparison of LSB scheduling algorithm with existing algorithms and also suggest a guideline for selecting the suitable algorithm for certain industrial settings.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2002년도 춘계공동학술대회
• /
• pp.944-948
• /
• 2002

In industrial production setting scheduling problems of detalied day-to-day operations are often ordeals to production practitioners. For those who have scheduling experience with the Gantt Chart, the job oriented heuristic scheduling has illustrated its merits in solving practically large stale scheduling problems. It schedules all operations of a job within a finite capacity before considering the next job. This paper introduces a new LSB (load smoothing backward) scheduling algorithm for the job oriented heuristic scheduling. Through the computer simulation in a hypothetical setting, this paper provides a comparison of LSB scheduling with existing algorithms and a guideline for selecting the suitable algorithm for certain industrial setting.

• 산업경영시스템학회지
• /
• 제17권32호
• /
• pp.105-112
• /
• 1994

The purpose of this paper is to develope a heuristic algorithm to maximize reduction rate of the processing time by the connection of neighbored machines. A method to calculate the start-lag and stop-lag for the overlapping production is proposed and applied. The heuristic procedure of this paper has 3 steps. In the first and second step, the job oriented procedure is applied. In the final step, the operation oriented procedure is applied. In order to evaluate the performance of this algorithm, three kinds of performance measures are selected and randomly generated problems are tested.

• 대한안전경영과학회지
• /
• 제13권4호
• /
• pp.125-137
• /
• 2011

Customers are generally requiring a variety of products, earlier due date, and lower price. A manufacturing process needs the efficient scheduling to meet those customer's requirements. This study proposes the novel algorithm named MJA(Minimum Job completion time and AGV time) that increases the performance of machines and AGV(Automated Guided Vehicles) in many kinds of job types. MJA optimizes the bottleneck of machines and efficiency of AGV with considering two types of dispatching at the same time. Suggested algorithm was compared with existing heuristic methods by several simulations, it performed better for reducing the time of tardiness.

• 경영과학
• /
• 제17권2호
• /
• pp.87-95
• /
• 2000

This paper presents two analytical approaches to determine the vehicle fleet size for container shuttle service. The shuttle service can be defined as the repetitive travel between the designated places during working period. In the first approach, the transportation model is adopted in order to determine the number of vehicles required. Its advantages and disadvantages in practical application are also discussed. In the second approach, a logical network which is oriented on job is transformed from a physical network which is focused on demand site. Nodes on the logical network represent jobs which include loaded travel, loading and unloading and arcs represent empty travel for the next jobs which include loaded travel, loading and unloading and arcs represent empty travel for the next job. Then a mathematical formulation is constructed similar to the multiple traveling salesman problem (TSP). A solution procedure is carried out based on the well-known insertion heuristic with the real world data.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2000년도 춘계공동학술대회 논문집
• /
• pp.183-187
• /
• 2000

In this study, we design a scheduling system for painting shop, called HYPOS(Hyundai heavy industry Painting shop Operating System) and develop a system implementing the design. The painting shop operations are currently scheduled manually by experts. Manual scheduling is a serious time consuming job and generally can not guarantee a full optimality. Building a traditional heuristic scheduling system lot this problem, however, is not promising because there are various kinds of constraints to be satisfied including space allocation of shipbuilding blocks in a painting cell. We, therefore, adopt a spatial scheduling approach and develop scheduling algorithms based on field-oriented scheduling heuristics and computational geometry. And we show that the algorithms can successfully be applied to the painting shop scheduling problem.