• Title/Summary/Keyword: scheduling

Search Result 4,863, Processing Time 0.034 seconds

Heuristic Algorithms for Resource Leveling in Pre-Erection Scheduling and Erection Scheduling of Shipbuilding (조선 선행탑재 및 탑재 일정계획에서의 부하평준화를 위한 발견적 기법)

  • Woo, Sang-Bok;Ryu, Hyung-Gon;Hahn, Hyung-Sang
    • IE interfaces
    • /
    • v.16 no.3
    • /
    • pp.332-343
    • /
    • 2003
  • This paper deals with pre-erection scheduling and erection scheduling in shipbuilding. Among shipbuilding scheduling, the ship erection scheduling in a dock is one of the most important since the dock is the most critical resource in a shipyard. However, it is more reasonable to consider pre-erection scheduling and erection scheduling as unified because they compete with the common constrained resources such as labor, crane, space, and so on. It is very hard to consider two scheduling problems simultaneously, and hence, we approach them sequentially. At first, we propose space resource leveling heuristics in pre-erection scheduling given erection date. And then, considering the manpower resource determined by pre-erection scheduling, we also propose manpower resource leveling heuristics in erection scheduling. Various experimental results with real world data show that the proposed heuristics have good performance in terms of scheduling quality and time.

NEW TREND OF SCHEDULING IN LINEAR CONSTRUCTION PROJECT

  • S. Sankar;J. Senthil
    • International conference on construction engineering and project management
    • /
    • 2005.10a
    • /
    • pp.917-923
    • /
    • 2005
  • Scheduling is one of the main functions in construction project to determine the sequence of activities necessary to complete a project. The scheduling techniques provide important information crucial to a project's success. Highway construction project the paving activity can be considered a linear activity. Linear scheduling technique may be better suited for linear projects than other scheduling techniques. A new type of scheduling in linear project is calling Linear Scheduling Model (LSM). The Project monitoring and controlling is very ease to identify that all the stage of linear project and have more advantages.

  • PDF

The Performance Analysis of CPU scheduling Algorithms in Operating Systems

  • Thangakumar Jeyaprakash;Ranjana P;Sambath M
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.7
    • /
    • pp.165-170
    • /
    • 2023
  • Scheduling algorithms plays a significant role in optimizing the CPU in operating system. Each scheduling algorithms schedules the processes in the ready queue with its own algorithm design and its properties. In this paper, the performance analysis of First come First serve scheduling, Non preemptive scheduling, Preemptive scheduling, Shortest Job scheduling and Round Robin algorithm has been discussed with an example and the results has been analyzed with the performance parameters such as minimum waiting time, minimum turnaround time and Response time.

An On-line Scheduling Algorithm for a GRID System (GRID시스템을 위한 온라인 스케줄링 알고리즘)

  • 김학두;김진석;박형우
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.1_2
    • /
    • pp.95-101
    • /
    • 2004
  • The scheduling problem that maps independent tasks to heterogeneous resources in distributed computing systems is known as NP-complete[1]. GRID[2] is an example of distributed systems that consisted of heterogeneous resources. Many algorithms to solve this problem have been presented[1,3,4,5]. The scheduling algorithm can be classified into static scheduling algorithms and dynmic scheduling algorithms. A dynamic scheduling algorithm can be used when we can not predict the priority of tasks. Moreover, a dynamic scheduling algorithm can be divided into on-line mode algorithm and batch mode algorithm according to the scheduling time[1,6]. In this paper, we propose a new on-line mode scheduling algorithm. By extensive simulation, we can see that our scheduling algorithm outperforms previous scheduling algorithms.

Locomotive Scheduling Using Constraint Satisfaction Problems Programming Technique

  • Hwang, Jong-Gyu;Lee, Jong-Woo;Park, Yong-Jin
    • KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
    • /
    • v.4B no.1
    • /
    • pp.29-35
    • /
    • 2004
  • Locomotive scheduling in railway systems experiences many difficulties because of the complex interrelations among resources, knowledge and various constraints. Artificial intelligence technology has been applied to solve these scheduling problems. These technologies have proved to be efficient in representing knowledge and rules for complex scheduling problems. In this paper, we have applied the CSP (Constraints Satisfaction Problems) programming technique, one of the AI techniques, to solve the problems associated with locomotive scheduling. This method is more effective at solving complex scheduling problems than available mathematical programming techniques. The advanced locomotive scheduling system using the CSP programming technique is realized based on the actual timetable of the Saemaul type train on the Kyong-bu line. In this paper, an overview of the CSP programming technique is described, the modeling of domain and constraints is represented and the experimental results are compared with the real-world existing schedule. It is verified that the scheduling results by CSP programming are superior to existing scheduling performed by human experts. The executing time for locomotive scheduling is remarkably reduced to within several decade seconds, something requiring several days in the case of locomotive scheduling by human experts.

Efficient Channel State Feedback Scheme for Opportunistic Scheduling in OFDMA Systems by Scheduling Probability Prediction

  • Ko, Soomin;Lee, Jungsu;Lee, Byeong Gi;Park, Daeyoung
    • Journal of Communications and Networks
    • /
    • v.15 no.6
    • /
    • pp.589-600
    • /
    • 2013
  • In this paper, we propose a new feedback scheme called mode selection-based feedback by scheduling probability prediction (SPP-MF) for channel state feedback in OFDMA downlink system. We design the scheme such that it determines the more desirable feedback mode among selective feedback by scheduling probability prediction (SPP-SF) mode and bitmap feedback by scheduling probability prediction (SPP-BF) mode, by calculating and comparing the throughputs of the two modes. In both feedback modes, each user first calculates the scheduling probability of each subchannel (i.e., the probability that a user wins the scheduling competition for a subchannel) and then forms a feedback message based on the scheduling probability. Specifically, in the SPP-SF mode, each user reports the modulation and coding scheme (MCS) levels and indices of its best S subchannels in terms of the scheduling probability. In the SPP-BF mode, each user determines its scheduling probability threshold. Then, it forms a bitmap for the subchannels according to the scheduling probability threshold and sends the bitmap along with the threshold. Numerical results reveal that the proposed SPP-MF scheme achieves significant performance gain over the existing feedback schemes.

Development of Agent-based Platform for Coordinated Scheduling in Global Supply Chain (글로벌 공급사슬에서 경쟁협력 스케줄링을 위한 에이전트 기반 플랫폼 구축)

  • Lee, Jung-Seung;Choi, Seong-Woo
    • Journal of Intelligence and Information Systems
    • /
    • v.17 no.4
    • /
    • pp.213-226
    • /
    • 2011
  • In global supply chain, the scheduling problems of large products such as ships, airplanes, space shuttles, assembled constructions, and/or automobiles are complicated by nature. New scheduling systems are often developed in order to reduce inherent computational complexity. As a result, a problem can be decomposed into small sub-problems, problems that contain independently small scheduling systems integrating into the initial problem. As one of the authors experienced, DAS (Daewoo Shipbuilding Scheduling System) has adopted a two-layered hierarchical architecture. In the hierarchical architecture, individual scheduling systems composed of a high-level dock scheduler, DAS-ERECT and low-level assembly plant schedulers, DAS-PBS, DAS-3DS, DAS-NPS, and DAS-A7 try to search the best schedules under their own constraints. Moreover, the steep growth of communication technology and logistics enables it to introduce distributed multi-nation production plants by which different parts are produced by designated plants. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. No standard coordination mechanism of multiple scheduling systems exists, even though there are various scheduling systems existing in the area of scheduling research. Previous research regarding the coordination mechanism has mainly focused on external conversation without capacity model. Prior research has heavily focuses on agent-based coordination in the area of agent research. Yet, no scheduling domain has been developed. Previous research regarding the agent-based scheduling has paid its ample attention to internal coordination of scheduling process, a process that has not been efficient. In this study, we suggest a general framework for agent-based coordination of multiple scheduling systems in global supply chain. The purpose of this study was to design a standard coordination mechanism. To do so, we first define an individual scheduling agent responsible for their own plants and a meta-level coordination agent involved with each individual scheduling agent. We then suggest variables and values describing the individual scheduling agent and meta-level coordination agent. These variables and values are represented by Backus-Naur Form. Second, we suggest scheduling agent communication protocols for each scheduling agent topology classified into the system architectures, existence or nonexistence of coordinator, and directions of coordination. If there was a coordinating agent, an individual scheduling agent could communicate with another individual agent indirectly through the coordinator. On the other hand, if there was not any coordinating agent existing, an individual scheduling agent should communicate with another individual agent directly. To apply agent communication language specifically to the scheduling coordination domain, we had to additionally define an inner language, a language that suitably expresses scheduling coordination. A scheduling agent communication language is devised for the communication among agents independent of domain. We adopt three message layers which are ACL layer, scheduling coordination layer, and industry-specific layer. The ACL layer is a domain independent outer language layer. The scheduling coordination layer has terms necessary for scheduling coordination. The industry-specific layer expresses the industry specification. Third, in order to improve the efficiency of communication among scheduling agents and avoid possible infinite loops, we suggest a look-ahead load balancing model which supports to monitor participating agents and to analyze the status of the agents. To build the look-ahead load balancing model, the status of participating agents should be monitored. Most of all, the amount of sharing information should be considered. If complete information is collected, updating and maintenance cost of sharing information will be increasing although the frequency of communication will be decreasing. Therefore the level of detail and updating period of sharing information should be decided contingently. By means of this standard coordination mechanism, we can easily model coordination processes of multiple scheduling systems into supply chain. Finally, we apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly- plant-scheduling agents, and a meta-level coordination agent. A series of experiments using the real world data are used to empirically examine this mechanism. The results of this study show that the effect of agent-based platform on coordinated scheduling is evident in terms of the number of tardy jobs, tardiness, and makespan.

Design of a Coordinating Mechanism for Multi-Level Scheduling Systems in Supply Chain

  • Lee, Jung-Seung;Kim, Soo
    • Journal of Information Technology Applications and Management
    • /
    • v.19 no.1
    • /
    • pp.37-46
    • /
    • 2012
  • The scheduling problem of large products like ships, airplanes, space shuttles, assembled constructions, and automobiles is very complex in nature. To reduce inherent computational complexity, we often design scheduling systems that the original problem is decomposed into small sub-problems, which are scheduled independently and integrated into the original one. Moreover, the steep growth of communication technology and logistics makes it possible to produce a lot of multi-nation corporation by which products are produced across more than one plant. Therefore vertical and lateral coordination among decomposed scheduling systems is necessary. In this research, we suggest an agent-based coordinating mechanism for multi-level scheduling systems in supply chain. For design of a general coordination mechanism, at first, we propose a grammar to define individual scheduling agents which are responsible to their own plants, and a meta-level coordination agent which is engaged to supervise individual scheduling agents. Second, we suggest scheduling agent communication protocols for each scheduling agent topology which is classified according to the system architecture, existence of coordinator, and direction of coordination. We also suggest a scheduling agent communication language which consists of three layers : Agent Communication Layer, Scheduling Coordination Layer, Industry-specific Layer. Finally, in order to improve the efficiency of communication among scheduling agents we suggest a rough capacity coordination model which supports to monitor participating agents and analyze the status of them. With this coordination mechanism, we can easily model coordination processes of multiple scheduling systems. In the future, we will apply this mechanism to shipbuilding domain and develop a prototype system which consists of a dock-scheduling agent, four assembly-plant-scheduling agents, and a meta-level coordination agent. A series of experiment using the real-world data will be performed to examine this mechanism.

Operation Scheduling System for Hull Block Fabrication in Shipbuilding using Genetic Algorithm (유전 알고리즘을 이용한 선각 가공 작업일정계획 시스템의 개발에 관한 연구)

  • Cho, Kyu-Kab;Kim, Young-Goo;Ryu, Kwang-Ryel;Hwang, Jun-Ha;Choi, Hyung-Rim
    • IE interfaces
    • /
    • v.11 no.3
    • /
    • pp.115-128
    • /
    • 1998
  • This paper presents a development of operation scheduling and reactive operation scheduling system for hull fabrication. The methodology for implementing operation scheduling system is HHGA(Hierarchical Hybrid Genetic Algorithm) which exploits both the global perspective of the genetic algorithm and the rapid convergence of the heuristic search for operation scheduling. The methodology for the reactive operation scheduling is the revised HHGA which consists of manual schedule editor for occurrence of exceptional events and the revised scheduling method used in operation scheduling. As the results of experiment, it has been confirmed that HHGA is able to search good operation scheduling within reasonable time, and the revised HHGA is able to search load-balanced reactive operation scheduling with minimum changes of initial operation schedule within short period of time.

  • PDF

A Study on the Development of Expert Scheduling Program (전문가 스케쥴링 프로그램의 개발에 관한 연구)

  • 신용진;박노국;송문익
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.15 no.26
    • /
    • pp.21-31
    • /
    • 1992
  • Today, manpower is used as a major factor in the production of service industry that is on the increasing trend. So the research on manpower structure have been regarded as a important field. The research on personnel scheduling, however, have got de-emphasizeed as compared wi th the field of manufacturing scheduling. As the increasing trend of service industry, an appropriate personnel scheduling for each type of service industry is needed urgently. This paper deals with nurse scheduling problem in the field of personnel scheduling. We aim at developing prototype of the expert nurse scheduling program which is easy to use when scheduling without help of expert, and satisfies the various request of hospital scheduling policy and nurse scheduling.

  • PDF