• Title/Summary/Keyword: scheduling management

Search Result 1,280, Processing Time 0.023 seconds

A Study on Determining Single-Center Scheduling using LTV(LifeTime Value) (고객 생애 가치를 활용한 단일 창구 일정계획 수립에 관한 연구)

  • 양광모;박재현;강경식
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2003.05a
    • /
    • pp.285-290
    • /
    • 2003
  • 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. 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.

  • PDF

A Priority Allocation Scheme Considering Virtual Machine Scheduling Delays in Xen Environments (Xen 환경에서 스케줄링 지연을 고려한 가상머신 우선순위 할당 기법)

  • Yang, Eun-Ji;Choi, Hyun-Sik;Han, Sae-Young;Park, Sung-Yong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.37 no.4
    • /
    • pp.246-255
    • /
    • 2010
  • There exist virtual machine scheduling delays in virtualized environment in which virtual machines share physical resources. Many resource management systems have been proposed to provide better application QoS through monitoring and analyzing application performance and resource utilization of virtual machines. However, those management systems don't consider virtual machine scheduling delays, result in incorrect application performance evaluation and QoS violations In this paper, we propose an application behavior analysis considering the scheduling delays, and a virtual machine priority allocation scheme based on the analysis to improve the application response time by minimizing the overall virtual machine scheduling delays.

Radio Resource Management of CoMP System in HetNet under Power and Backhaul Constraints

  • Yu, Jia;Wu, Shaohua;Lin, Xiaodong;Zhang, Qinyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.11
    • /
    • pp.3876-3895
    • /
    • 2014
  • Recently, Heterogeneous Network (HetNet) with Coordinated Multi-Point (CoMP) scheme is introduced into Long Term Evolution-Advanced (LTE-A) systems to improve digital services for User Equipments (UEs), especially for cell-edge UEs. However, Radio Resource Management (RRM), including Resource Block (RB) scheduling and Power Allocation (PA), in this scenario becomes challenging, due to the intercell cooperation. In this paper, we investigate the RRM problem for downlink transmission of HetNet system with Joint Processing (JP) CoMP (both joint transmission and dynamic cell selection schemes), aiming at maximizing weighted sum data rate under the constraints of both transmission power and backhaul capacity. First, joint RB scheduling and PA problem is formulated as a constrained Mixed Integer Programming (MIP) which is NP-hard. To simplify the formulation problem, we decompose it into two problems of RB scheduling and PA. For RB scheduling, we propose an algorithm with less computational complexity to achieve a suboptimal solution. Then, according to the obtained scheduling results, we present an iterative Karush-Kuhn-Tucker (KKT) method to solve the PA problem. Extensive simulations are conducted to verify the effectiveness and efficiency of the proposed algorithms. Two kinds of JP CoMP schemes are compared with a non-CoMP greedy scheme (max capacity scheme). Simulation results prove that the CoMP schemes with the proposed RRM algorithms dramatically enhance data rate of cell-edge UEs, thereby improving UEs' fairness of data rate. Also, it is shown that the proposed PA algorithms can decrease power consumption of transmission antennas without loss of transmission performance.

Heuristics for Job Shop Scheduling Problems with Progressive Weighted Tardiness Penalties and Inter-machine Overlapping Sequence-dependent Setup Times

  • Mongkalig, Chatpon;Tabucanon, Mario T.;Hop, Nguyen Van
    • Industrial Engineering and Management Systems
    • /
    • v.4 no.1
    • /
    • pp.1-22
    • /
    • 2005
  • This paper presents new scheduling heuristics, namely Mean Progressive Weighted Tardiness Estimator (MPWT) Heuristic Method and modified priority rules with sequence-dependent setup times consideration. These are designed to solve job shop scheduling problems with new performance measures - progressive weighted tardiness penalties. More realistic constraints, which are inter-machine overlapping sequence-dependent setup times, are considered. In real production environments, inter-machine overlapping sequence-dependent setups are significant. Therefore, modified scheduling generation algorithms of active and nondelay schedules for job shop problems with inter-machine overlapping sequence-dependent setup times are proposed in this paper. In addition, new customer-based measures of performance, which are total earliness and progressive weighted tardiness, and total progressive weighted tardiness, are proposed. The objective of the first experiment is to compare the proposed priority rules with the consideration of sequence-dependent setup times and the standard priority rules without setup times consideration. The results indicate that the proposed priority rules with setup times consideration are superior to the standard priority rules without the consideration of setup times. From the second experiment and the third experiment to compare the proposed MPWT heuristic approach with the efficient priority rules with setup times consideration, the MPWT heuristic method is significantly superior to the Batched Apparent Tardiness Cost with Sequence-dependent Setups (BATCS) rule, and other priority rules based on total earliness and progressive weighted tardiness, and total earliness and tardiness.

Information Systems for Organizational Agility: Action Research on Resource Scheduling at the Universidad de Chile

  • Seo, Dong Back;La Paz, Ariel I.;Miranda, Jaime
    • Asia pacific journal of information systems
    • /
    • v.24 no.4
    • /
    • pp.417-441
    • /
    • 2014
  • Organizations need to exhibit characteristics of agility to stay ahead of their competitors and to survive in dynamic environments. One major concern for organizations is how to implement Information Systems (ISs) to enhance their agility. Organizations tend to spend too many resources to change their entire IS instead of only the components that cause problems without exactly knowing whether it enables or suppress organizational agility. To address these shortcomings and practical issues, we provide a framework to assess organizational agility and to diagnose a problem related to IS. By applying this prototype of the Agility Framework, we were able to diagnose a problem that the department of Management Control and Information Systems at the Universidad de Chile had and planned actions for them to improve its organizational agility with a course scheduling system, eClasSkeduler. This action research, which took more than 25-month for the first cycle, further develops the Agility Framework, which not only provides a way to link IS with organizational functions but also illustrates how to use it to diagnose a situation and plan actions for improving organizational agility through an information system.