• Title/Summary/Keyword: scheduling management

Search Result 1,280, Processing Time 0.024 seconds

MODIFIED SIMULATED ANNEALING ALGORITHM FOR OPTIMIZING LINEAR SCHEDULING PROJECTS WITH MULTIPLE RESOURCE CONSTRAINTS

  • Po-Han Chen;Seyed Mohsen Shahandashti
    • International conference on construction engineering and project management
    • /
    • 2007.03a
    • /
    • pp.777-786
    • /
    • 2007
  • This paper presents a modified simulated annealing algorithm to optimize linear scheduling projects with multiple resource constraints and its effectiveness is verified with a proposed problem. A two-stage solution-finding procedure is used to model the problem. Then the simulated annealing and the modified simulated annealing are compared in the same condition. The comparison results and the reasons of improvement by the modified simulated annealing are presented at the end.

  • PDF

FLEXIBLE OPTIMIZATION MODEL FOR LINEAR SCHEDULING PROBLEMS

  • Shu-Shun Liu;Chang-Jung Wang
    • International conference on construction engineering and project management
    • /
    • 2005.10a
    • /
    • pp.802-807
    • /
    • 2005
  • For linear projects, it has long been known that resource utilization is important in improving work efficiency. However, most existing scheduling techniques cannot satisfy the need for solving such issues. This paper presents an optimization model for solving linear scheduling problems involving resource assignment tasks. The proposed model adopts constraint programming (CP) as the searching algorithm for model formulation, and the proposed model is designed to optimize project total cost. Additionally, the concept of outsourcing resources is introduced here to improve project performance.

  • PDF

Survey of Evolutionary Algorithms in Advanced Planning and Scheduling

  • Gen, Mitsuo;Zhang, Wenqiang;Lin, Lin
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.35 no.1
    • /
    • pp.15-39
    • /
    • 2009
  • Advanced planning and scheduling (APS) refers to a manufacturing management process by which raw materials and production capacity are optimally allocated to meet demand. APS is especially well-suited to environments where simpler planning methods cannot adequately address complex trade-offs between competing priorities. However, most scheduling problems of APS in the real world face both inevitable constraints such as due date, capability, transportation cost, set up cost and available resources. In this survey paper, we address three crucial issues in APS, including basic scheduling model, job-shop scheduling (JSP), assembly line balancing (ALB) model, and integrated scheduling models for manufacturing and logistics. Several evolutionary algorithms which adapt to the problems are surveyed and proposed; some test instances based on the practical problems demonstrate the effectiveness and efficiency of evolutionary approaches.

A Study on the Process Design of Advanced Planning & Scheduling for Transformer Operation Improvement (변합기 공정 개선을 위한 APS(Advanced Planning & Scheduling) 프로세스 설계에 관한 연구)

  • Hwang, Duk-Hyuong;Nam, Seung-Don;Cho, Young-Wook;Oh, Sun-Il;La, Seoung-Hun;Kang, Kyong-Sik
    • Journal of the Korea Safety Management & Science
    • /
    • v.14 no.2
    • /
    • pp.159-166
    • /
    • 2012
  • As enterprises, based on the forecast of the customer's demand and collaboration with the suppliers, establish the integrated system directing supply, production, and distribution for the increase of productivity, Thus, this study intends to find the most urgent and critical factors for the improvement of the information system by externalizing factors affecting the operation of information system, suggest the process to improve the relevant functions of information system, and design the process. As a result of the analysis of the previous studies on the improvement of the information system, many studies were conducted on the improvement of ERP and SCM, yet there was no study conducted targeting about APS (Advanced Planning & Scheduling). Thus, this study chose APS as the subject for the design of the process for the improvement for the information system.

Project scheduling by FGP to Time-Cost-Quality trade off: construction case study

  • Faregh, Najmeh;Ketabi, Saeedeh;Ghandehari, Mahsa
    • Journal of Construction Engineering and Project Management
    • /
    • v.4 no.3
    • /
    • pp.53-59
    • /
    • 2014
  • Project managers are responsible to conduct project on time with least amount of costs and the most possible quality with respect to shortage of resources and environmental certainties. They have to make the best decision to reach such conflicting objects. In this study the project scheduling with multi goals-multi modes was planned in fuzzy conditions under resource constraints and expanded by fuzzy goal programing (FGP). The project cost was calculated by the price of renewable resources and the quality criteria were evaluated by the quality function deployment method (QFD). Finally the model was verified by a construction case study with 22 activities along with solving by GAMS. The results showed that this model could provide a systematic framework to facilitate the decision making process and made the project managers to be able to schedule the project closer to reality.

An Improved Task Scheduling Algorithm for Efficient Dynamic Power Management in Real-Time Systems (실시간 시스템에서 효율적인 동적 전력 관리를 위한 태스크 스케줄링 알고리듬에 관한 연구)

  • Lee Won-Gyu;Hwang Sun-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.4A
    • /
    • pp.393-401
    • /
    • 2006
  • Energy consumption is an important design parameter for battery-operated embedded systems. Dynamic power management is one of the most well-known low-power design techniques. This paper proposes an online realtime scheduling algorithm, which we call energy-aware realtime scheduling using slack stealing (EARSS). The proposed algorithm gives the highest priority to the task with the largest degree of device overlap when the slack time exists. Scheduling result enables an efficient power management by reducing the number of state transitions. Experimental results show that the proposed algorithm can save the energy by 23% on average compared to the DPM-enabled system scheduled by the EDF algorithm.

SIMULATED ANNEALING FOR LINEAR SCHEDULING PROJECTS WITH MULTIPLE RESOURCE CONSTRAINTS

  • C.I. Yen
    • International conference on construction engineering and project management
    • /
    • 2007.03a
    • /
    • pp.530-539
    • /
    • 2007
  • Many construction projects such as highways, pipelines, tunnels, and high-rise buildings typically contain repetitive activities. Research has shown that the Critical Path Method (CPM) is not efficient in scheduling linear construction projects that involve repetitive tasks. Linear Scheduling Method (LSM) is one of the techniques that have been developed since 1960s to handle projects with repetitive characteristics. Although LSM has been regarded as a technique that provides significant advantages over CPM in linear construction projects, it has been mainly viewed as a graphical complement to the CPM. Studies of scheduling linear construction projects with resource consideration are rare, especially with multiple resource constraints. The objective of this proposed research is to explore a resource assignment mechanism, which assigns multiple critical resources to all activities to minimize the project duration while satisfying the activities precedence relationship and resource limitations. Resources assigned to an activity are allowed to vary within a range at different stations, which is a combinatorial optimization problem in nature. A heuristic multiple resource allocation algorithm is explored to obtain a feasible initial solution. The Simulated Annealing search algorithm is then utilized to improve the initial solution for obtaining near-optimum solutions. A housing example is studied to demonstrate the resource assignment mechanism.

  • PDF

A Real-Time Scheduling System Architecture in Next Generation Wafer Production System (차세대 웨이퍼 생산시스템에서의 실시간 스케줄링 시스템 아키텍처)

  • Lee, Hyun;Hur, Sun;Park, You-Jin;Lee, Gun-Woo;Cho, Yong-Ju
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.3
    • /
    • pp.184-191
    • /
    • 2010
  • In the environment of 450mm wafers production known as the next-generation semiconductor production process, one of the most significant features is the full automation over the whole manufacturing processes involved. The full automation system for 450mm wafer production will minimize the human workers' involvement in the manufacturing process as much as possible. In addition, since the importance of an individual wafer processing increases noticeably, it is necessary to develop more robust scheduling systems in the whole manufacturing process than so ever. The scheduling systems for the next-generation semiconductor production processes also should be capable of monitoring individual wafers and collecting useful data on them in real time. Based on the information gathered from these processes, the system should finally have a real-time scheduling functions controlling whole the semiconductor manufacturing processes. In this study, preliminary investigations on the requirements and needed functions for constructing the real time scheduling system and transforming manufacturing environments for 300mm wafers to those of 400mm are conducted and through which the next generation semiconductor processes for efficient scheduling in a clustered production system architecture of the scheduler is proposed. Our scheduling architecture is composed of the modules for real-time scheduling, the clustered production type supporting, the optimal scheduling and so on. The specifications of modules to define the major required functions, capabilities, and the relationship between them are presented.

Resource Constrained Dynamic Multi-Projects Scheduling Based by Constraint Programming (Constraint Programming을 이용한 자원제약 동적 다중프로젝트 일정계획)

  • Lee, Hwa-Ki;Chung, Je-Won
    • IE interfaces
    • /
    • v.12 no.3
    • /
    • pp.362-373
    • /
    • 1999
  • Resource Constrained Dynamic Multi-Projects Scheduling (RCDMPS) is intended to schedule activities of two or more projects sequentially arriving at die shop under restricted resources. The aim of this paper is to develop a new problem solving method for RCDMPS to make an effect schedule based by constraint programming. The constraint-based scheduling method employs ILOG Solver which is C++ constraint reasoning library for solving complex resource management problems and ILOG Schedule which is a add-on library to ILOG Solver dedicated to solving scheduling problems. And this method interfaces with ILOG Views so that the result of scheduling displays with Gantt chart. The scheduling method suggested in this paper was applied to a company scheduling problem and compared with the other heuristic methods, and then it shows that the new scheduling system has more preference.

  • PDF

Multiobjective Genetic Algorithm for Scheduling Problems in Manufacturing Systems

  • Gen, Mitsuo;Lin, Lin
    • Industrial Engineering and Management Systems
    • /
    • v.11 no.4
    • /
    • pp.310-330
    • /
    • 2012
  • Scheduling is an important tool for a manufacturing system, where it can have a major impact on the productivity of a production process. In manufacturing systems, the purpose of scheduling is to minimize the production time and costs, by assigning a production facility when to make, with which staff, and on which equipment. Production scheduling aims to maximize the efficiency of the operation and reduce the costs. In order to find an optimal solution to manufacturing scheduling problems, it attempts to solve complex combinatorial optimization problems. Unfortunately, most of them fall into the class of NP-hard combinatorial problems. Genetic algorithm (GA) is one of the generic population-based metaheuristic optimization algorithms and the best one for finding a satisfactory solution in an acceptable time for the NP-hard scheduling problems. GA is the most popular type of evolutionary algorithm. In this survey paper, we address firstly multiobjective hybrid GA combined with adaptive fuzzy logic controller which gives fitness assignment mechanism and performance measures for solving multiple objective optimization problems, and four crucial issues in the manufacturing scheduling including a mathematical model, GA-based solution method and case study in flexible job-shop scheduling problem (fJSP), automatic guided vehicle (AGV) dispatching models in flexible manufacturing system (FMS) combined with priority-based GA, recent advanced planning and scheduling (APS) models and integrated systems for manufacturing.