• Title/Summary/Keyword: Look-ahead schedule

Search Result 4, Processing Time 0.017 seconds

An Unload and Load Request Logic for Semiconductor Fab Considering Inter-Bay Material Flow (Inter-Bay 물류 흐름을 고려한 반도체 Fab의 Unload 및 Load Request Logic 개발)

  • Suh, Jung-Dae;Koo, Pyung-Hoi;Jang, Jae-Jin
    • IE interfaces
    • /
    • v.17 no.spc
    • /
    • pp.131-140
    • /
    • 2004
  • The purpose of this paper is to develop and show the efficiency of the URL(Unload Request Logic) and LRL(Load Request Logic) of the dispatcher in the Fab(Fabrication) Manufacturing Execution System. These logics are the core procedures which control the material(wafer and glass substrate) flow efficiently in the semiconductor and LCD fab considering inter-bay as well as intra-bay material flow. We use the present and future status information of the system by look-ahead and the information about the future transportation schedule of Automated Guided Vehicles. The simulation results show that the URL and LRL presented in this paper reduce the average lead time, average and maximum WIP level, and the average available AGV waiting time.

An Improved Genetic Algorithm to Minimize Makespan in Flowshop with Availability Constraints (기계 가용성 제약을 고려한 흐름공정 상황하에서 Makespan을 최소화하기 위한 향상된 유전 알고리듬)

  • Lee, Kyung-Hwa;Jeong, In-Jae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.30 no.1
    • /
    • pp.115-121
    • /
    • 2007
  • In this paper, we study flowshop scheduling problems with availability constraints. In such problems, n jobs have to be scheduled on m machines sequentially under assumption that the machines are unavailable during some periods of planning horizon. The objective of the problem is to find a non-permutation schedule which minimizes the makespan. As a solution procedure, we propose an improved genetic algorithm which utilizes a look-ahead schedule generator to find good solutions in a reasonable time Computational experiments show that the proposed genetic algorithm outperforms the existing genetic algorithm.

A Systematic Approach Of Construction Management Based On Last Planner System And Its Implementation In The Construction Industry

  • Hussain, SM Abdul Mannan;Sekhar, Dr.T.Seshadri;Fatima, Asra
    • Journal of Construction Engineering and Project Management
    • /
    • v.5 no.2
    • /
    • pp.11-15
    • /
    • 2015
  • The Last PlannerSystem (LPS) has been implemented on construction projects to increase work flow reliability, a precondition for project performance againstproductivity and progress targets. The LPS encompasses four tiers of planning processes:master scheduling, phase scheduling, lookahead planning, and commitment / weeklywork planning. This research highlights deficiencies in the current implementation of LPS including poor lookahead planning which results in poor linkage between weeklywork plans and the master schedule. This poor linkage undetermines the ability of theweekly work planning process to select for execution tasks that are critical to projectsuccess. As a result, percent plan complete (PPC) becomes a weak indicator of project progress. The purpose of this research is to improve lookahead planning (the bridgebetween weekly work planning and master scheduling), improve PPC, and improve theselection of tasks that are critical to project success by increasing the link betweenShould, Can, Will, and Did (components of the LPS), thereby rendering PPC a betterindicator of project progress. The research employs the case study research method to describe deficiencies inthe current implementation of the LPS and suggest guidelines for a better application ofLPS in general and lookahead planning in particular. It then introduces an analyticalsimulation model to analyze the lookahead planning process. This is done by examining the impact on PPC of increasing two lookahead planning performance metrics: tasksanticipated (TA) and tasks made ready (TMR). Finally, the research investigates theimportance of the lookahead planning functions: identification and removal ofconstraints, task breakdown, and operations design.The research findings confirm the positive impact of improving lookaheadplanning (i.e., TA and TMR) on PPC. It also recognizes the need to perform lookaheadplanning differently for three types of work involving different levels of uncertainty:stable work, medium uncertainty work, and highly emergent work.The research confirms the LPS rules for practice and specifically the need to planin greater detail as time gets closer to performing the work. It highlights the role of LPSas a production system that incorporates deliberate planning (predetermined andoptimized) and situated planning (flexible and adaptive). Finally, the research presents recommendations for production planningimprovements in three areas: process related, (suggesting guidelines for practice),technical, (highlighting issues with current software programs and advocating theinclusion of collaborative planning capability), and organizational improvements(suggesting transitional steps when applying the LPS).

Real Time Scheduling for Multiple Yard Cranes in an Automated Container Terminal (자동화 컨테이너 터미널의 복수 장치장 크레인을 위한 실시간 작업 계획 수립)

  • Park, Tae-Jin;Choe, Ri;Ryu, Kwang-Ryel
    • Journal of Navigation and Port Research
    • /
    • v.31 no.10
    • /
    • pp.869-877
    • /
    • 2007
  • This paper proposes a realtime scheduling method using local search algorithm for non-crossable yard cranes in automated container terminal. To take into consideration the dynamic property of yard crane operation and satisfy the real time constraint, the proposed method repeatedly builds crane schedule for the jobs in a fixed length look-ahead horizon whenever a new job is requested In addition, the proposed method enables the co-operation between yard cranes through prior re-handling and re-positioning in order to resolve the workload imbalance problem between the two cranes, which is one of the primary causes that lower the performance of yard cranes. Simulation-based experiments have shown that the proposed method outperforms the heuristic based methods, and the cooperation scheme contributes a lot to the performance improvement.