• Title/Summary/Keyword: scheduling criteria

Search Result 97, Processing Time 0.033 seconds

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.

Real-time Scheduling of Scrap Disposal using Multi-Pass Simulation in Steel Industry (Multi-Pass 시뮬레이션을 이용한 제철소 구내의 스크랩 운송 실시간 스케줄링)

  • Lee, Tae-Ha;Park, Sung-Sik;Cho, Hyun-Bo
    • IE interfaces
    • /
    • v.11 no.1
    • /
    • pp.119-129
    • /
    • 1998
  • The relative importance of Logistics in steelworks industry is rather higher among other business activities. The objective of the paper is to propose the methodology for real-time vehicle scheduling for scrap disposal in the steelworks industry. Currently, the rule necessary to assign vehicles to a specific job is strictly fixed. The paper adopts the multi-pass rule selector (MPRS) that suggests a promising rule used for vehicle dispatching for a period of time. The MPRS is regularly invoked if necessary and then evaluates a set of rule candidates to select the best rule with respect to the system performance criteria. The experiment shows that the proposed approach outperforms the current single-pass strategy.

  • PDF

DBSW Algorithm Performance Criteria Using Queueing Theory (큐잉 이론을 이용한 DBSW 알고리즘 성능 분석)

  • Cho, Hae-Seong
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.11
    • /
    • pp.276-284
    • /
    • 2006
  • WRR scheme was developed for scheduling scheme for guaranteeing bandwidth requirement. In these days, WRR scheme can handle multiple queues straightforwardly by putting a different weight on each queue in order to offer differentiated services such as different bandwidth or delay bound in wireless communication network. Also, WRR algorithm can be implemented efficiently by dynamic binary scheduling wheel(DBSW) architecture. This paper performs the mathematical analysis of the DBSW architecture and compares the results with simulation results. The analysis data and simulation data show that the mathematical analysis developed properly.

  • PDF

Artificial Intelligence Gain-scheduling Adaptive PI Controller Scheme for Dual Active Bridge Converter (Dual Active Bridge 컨버터를 위한 인공지능 적응형 Gain-scheduling PI 제어기)

  • Kim, Sul-Gi;Choi, Hyun-Jun;Jung, Jee-Hoon
    • Proceedings of the KIPE Conference
    • /
    • 2014.07a
    • /
    • pp.556-557
    • /
    • 2014
  • This paper presents an artificial intelligence - Deep Belief Network (DBN) gain-scheduling adaptive PI controller scheme for dual active bridge (DAB) converter. The PI gains are allowed to vary within a predetermined range and therefore eliminate the problems faced by the conventional PI controller. The performance of the proposed controller is simulated and compared with the conventional fixed PI controller under various conditions. The experimental prototype of the DAB converter is implemented using a digital signal processor of TMS320F28335 manufactured by Texas Instrument to examine and to evaluate the performance criteria of the proposed controller. Simulation and experimental results show improvements in transient as well as steady state responses of the proposed controller over the conventional fixed PI controller.

  • PDF

A Multi-objective Optimization Approach to Workflow Scheduling in Clouds Considering Fault Recovery

  • Xu, Heyang;Yang, Bo;Qi, Weiwei;Ahene, Emmanuel
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.3
    • /
    • pp.976-995
    • /
    • 2016
  • Workflow scheduling is one of the challenging problems in cloud computing, especially when service reliability is considered. To improve cloud service reliability, fault tolerance techniques such as fault recovery can be employed. Practically, fault recovery has impact on the performance of workflow scheduling. Such impact deserves detailed research. Only few research works on workflow scheduling consider fault recovery and its impact. In this paper, we investigate the problem of workflow scheduling in clouds, considering the probability that cloud resources may fail during execution. We formulate this problem as a multi-objective optimization model. The first optimization objective is to minimize the overall completion time and the second one is to minimize the overall execution cost. Based on the proposed optimization model, we develop a heuristic-based algorithm called Min-min based time and cost tradeoff (MTCT). We perform extensive simulations with four different real world scientific workflows to verify the validity of the proposed model and evaluate the performance of our algorithm. The results show that, as expected, fault recovery has significant impact on the two performance criteria, and the proposed MTCT algorithm is useful for real life workflow scheduling when both of the two optimization objectives are considered.

A Dynamic Dispatching Algorithm for Operation of Automated Guided Vehicles and Machines in CIM Systems (CIM 시스템에서 기계가공과 AGV 의 운영을 위한 동적 작업배정 알고리듬)

  • Kim, Jung-Wook;Rhee, Jong-Tae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.21 no.1
    • /
    • pp.85-101
    • /
    • 1995
  • Automated Guided Vehicles(AGVs) are widely used in computer integrated manufacturing(CIM) systems for material handling purposes. Although automated guided vehicles provide higher levels of flexibility and computer integrability, the installations are limited in number and one of the critical reasons lies in the complexity involved in the operation. The main objective of this research is to alleviate this problem by proposing efficient integrated operational control methods for AGV-based CIM systems. Particularly, this research is concerned with the mixed problem of dispatching automated guided vehicles and scheduling machines operation. The proposed dynamic heuristic algorithm uses various priority schemes and relevant information concerning the load of the system, the status of queues, and the position of AGVs in the scheduling process. The scheduling decision process is hierarchical in the sense that different decision criteria are applied sequentially to identify the most appropriate part to be served. This algorithm consists of two sections, the section of part selection by AGVs for the next service whenever an AGV completes the current assignment, and the section of part selection by machines for next service whenever a machine completes the current operation. The proposed algorithm has been compared with other scheduling schemes using the performance measure of mean flow-time and mean tardiness. Simulation results indicate that the proposed algorithm can reduce the mean flow-time and mean tardiness significantly.

  • PDF

Deadline Constrained Adaptive Multilevel Scheduling System in Cloud Environment

  • Komarasamy, Dinesh;Muthuswamy, Vijayalakshmi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.4
    • /
    • pp.1302-1320
    • /
    • 2015
  • In cloud, everything can be provided as a service wherein a large number of users submit their jobs and wait for their services. hus, scheduling plays major role for providing the resources efficiently to the submitted jobs. The brainwave of the proposed ork is to improve user satisfaction, to balance the load efficiently and to bolster the resource utilization. Hence, this paper roposes an Adaptive Multilevel Scheduling System (AMSS) which will process the jobs in a multileveled fashion. The first level ontains Preprocessing Jobs with Multi-Criteria (PJMC) which will preprocess the jobs to elevate the user satisfaction and to itigate the jobs violation. In the second level, a Deadline Based Dynamic Priority Scheduler (DBDPS) is proposed which will ynamically prioritize the jobs for evading starvation. At the third level, Contest Mapping Jobs with Virtual Machine (CMJVM) is roposed that will map the job to suitable Virtual Machine (VM). In the last level, VM Scheduler is introduced in the two-tier VM rchitecture that will efficiently schedule the jobs and increase the resource utilization. These contributions will mitigate job iolations, avoid starvation, increase throughput and maximize resource utilization. Experimental results show that the performance f AMSS is better than other algorithms.

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.

A Study on Determining Single-Center Scheduling for LTV(LifeTime Value) Using Heuristic Method (휴리스틱 방법을 활용한 고객 생애 가치에 대한 단일 업체 일정계획 수립에 관한 연구)

  • 양광모;강경식
    • Journal of the Korea Safety Management & Science
    • /
    • v.5 no.1
    • /
    • pp.83-92
    • /
    • 2003
  • Scheduling plays an important role in shop floor planning. A scheduling shows the planned time when processing of a specific job will start on each machine that the job requires. It also indicates when the job will be completed on every process. Thus, it is a timetable for both jobs and machines. There is only one server available and arriving work require services from this server. Job are processed by the machine one at a time. The most common objective is to sequence jobs on the severs so as to minimize the penalty for being late, commonly called tardiness penalty. Based on other objectives, many criteria may serve as s basis for developing job schedules. The process also comprises all strategic planning, capital investments, management decisions, and tasks necessary to create a new product. manufacturing processes must be created so that the product can be produced in the product facility. Purchasing new equipment and training workers may be required if new technology is to be used. Tools, fixtures, and the sequence of steps in the manufacturing processes must all be developed to allow rapid, high-quality, cost effective production. Also, it may be needed to be rearrange the production facility to adapt to the new manufacturing processes. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem and reducing inventory, product development time, cycle time, and order lead time.

A New AAL2 Scheduling Algorithm for Mobile Voice and Data Services over ATM

  • Huhnkuk Lim;Dongwook lee;Kim, Kiseon;Kwangsuk Song;Changhwan Oh;Lee, Suwon
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.229-232
    • /
    • 2000
  • AAL2 has been adopted for bandwidth-efficient trans-mission of low bit tate traffic over ATM networks in ITUT and ATM Forum. Since ATM/AAL2 is expected to be used as a switching technology in third-generation mobile access networks and mobile data traffic is expected to increase rapidly in near future, there must be a need for efficient scheduling scheme satisfying the QoS requirement of ow bit rate voice as well as the one of high bit rate data. In this paper, we propose a new class-scheduling scheme to improve data packet loss probability, while Qos of voice traffic is guaranteed, when data traffic is multiplexed together with mobile voice traffic into a single ATM VCC. The proposed scheme can efficiently support data traffic by assigning a time threshold value to voice traffic. Through simulation study, we show that the proposed scheme does not only achieve better efficiency for providing both mobile voice and data services than HOL class-scheduling scheme and normal FIFO scheme, but also guarantees mean voice packet delay under a certain criteria.

  • PDF