• 산업경영시스템학회지
• /
• 제4권4호
• /
• pp.1-13
• /
• 1981

This paper analyses the efficiency of performance measures from the point of total cost on the accuracy of due date around various measures of performance be in mainly use in the flow shop scheduling theory. For this purpose, complete enumeration method for small problems seems to be the only possible means of evaluation and analysis. Using of the above technique, calculates the 800 Scheduling Problems, and represents it by the cumulative distributions.

• Management Science and Financial Engineering
• /
• 제20권2호
• /
• pp.33-37
• /
• 2014

A flow shop scheduling problem involves scheduling jobs on multiple machines in series in order to optimize a given criterion. The flow time of a job is the amount of time the job spent before its completion and the stretch of the job is the ratio of its flow time to its processing time. In this paper, a hybrid genetic algorithm (HGA) approach is proposed for minimizing the total stretch in flow shop scheduling. HGA adopts the idea of seed selection and development in order to reduce the chance of premature convergence that may cause the loss of search power. The performance of HGA is compared with that of genetic algorithms (GAs).

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.383-391
• /
• 2005

The paper is devoted to some flow shop scheduling problems, where job processing times are defined by functions dependent on their positions in the schedule. An example is constructed to show that the classical Johnson's rule is not the optimal solution for two different models of the two-machine flow shop scheduling to minimize makespan. In order to solve the makespan minimization problem in the two-machine flow shop scheduling, we suggest Johnson's rule as a heuristic algorithm, for which the worst-case bound is calculated. We find polynomial time solutions to some special cases of the considered problems for the following optimization criteria: the weighted sum of completion times and maximum lateness. Some furthermore extensions of the problems are also shown.

• 한국건축시공학회:학술대회논문집
• /
• 한국건축시공학회 2012년도 춘계 학술논문 발표대회
• /
• pp.303-305
• /
• 2012

This paper presents a system called a Cash-flow based Construction Scheduling Optimization (CfSO). The existing CPM is biased on schedule and cost management. For a profitable and successful project management, the cash-flow which occurred actually by contractual conditions should be considered in the project scheduling. Therefore, this study provides a method to estimate the amount of a cash-flow occurred periodically by integrating the terms of contract into scheduling. The proposed methodology is implemented as a system prototype in Microsoft Excel. CfSO helps a site manager as a decision-maker to establish a optimized project scheduling and decide profitable contractual conditions against a construction owner.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 춘계학술대회논문집A
• /
• pp.797-802
• /
• 2000

Flow shop scheduling problem involves processing several jobs on common facilities where a setup time Is incurred whenever there is a switch of jobs. Practical aspect of scheduling focuses on finding a near-optimum solution within a feasible time rather than striving for a global optimum. In this paper, a hybrid meta-heuristic method called tabu-genetic algorithm(TGA) is suggested, which combines the genetic algorithm(GA) with tabu list. The experiment shows that the proposed TGA can reach the optimum solution with higher probability than GA or SA(Simulated Annealing) in less time than TS(Tabu Search). It also shows that consideration of setup time becomes more important as the ratio of setup time to processing time increases.

• 산업경영시스템학회지
• /
• 제17권32호
• /
• pp.63-71
• /
• 1994

The purpose of this paper is to describe an effective cell scheduling system for flexible manufacturing cells. Based on the FMC characteristics, cell scheduling can be defined as a dynamic modified flow shop working in a real-time system. This paper attempt to find the optimal cell scheduling when minimizing the mean flow time for n-job/m-machine problems in static and dynamic environments. Real-time scheduling in an FMC environment requires rapid computation of the schedule.

• 전기학회논문지
• /
• 제56권10호
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• 한국경영과학회지
• /
• 제26권1호
• /
• pp.87-96
• /
• 2001

This paper considers the transfer batch scheduling problem for a two-machine flow shop with setup times consisting of attached setup time and separate setup time. The attached setup is attached to the processing and can be scheduled in anticipation of arriving work. Two cases of the separate setup are addressed. One is the case that the separate setup can be done only when a machine is idle. The other is the case that the separate setup can be done even though the machine is idle. the other is the case that the separate setup can be done even though the machine is operating. A scheduling rule similar to Johnson\`s rule is suggested to minimize makespan. the scheduling rule developed can be applied to most of the two-machine flow shop scheduling problems if some parameters are adjusted. A numerical example is presented to illustrate the scheduling rule.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권1호
• /
• pp.1-17
• /
• 2016

The separated management and operation of commercial IP/optical multilayer networks makes network operators look for a unified control plane (UCP) to reduce their capital and operational expenditure. Software-defined networking (SDN) provides a central control plane with a programmable mechanism, regarded as a promising UCP for future optical networks. The general control and scheduling mechanism in SDN-based optical burst switching (OBS) networks is insufficient so the controller has to process a large number of messages per second, resulting in low network resource utilization. In view of this, this paper presents the burst-flow scheduling mechanism (BFSM) with a proposed scheduling algorithm considering channel usage. The simulation results show that, compared with the general control and scheduling mechanism, BFSM provides higher resource utilization and controller performance for the SDN-based OBS network in terms of burst loss rate, the number of messages to which the controller responds, and the average latency of the controller to process a message.

• Journal of Communications and Networks
• /
• 제5권3호
• /
• pp.230-239
• /
• 2003

In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.