• Title/Summary/Keyword: Branch-and-Bound Algorithm

Search Result 191, Processing Time 0.03 seconds

Production-and-Delivery Scheduling with Transportation Mode Selection Allowed (수송수단의 선택이 허용된 생산 및 배송 스케줄링에 관한 연구)

  • Cho, Jung Keun;Lee, Ik Sun;Sung, Chang Sup
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.32 no.3
    • /
    • pp.163-171
    • /
    • 2006
  • This paper considers a scheduling problem to minimize the sum of the associated scheduling (production/delivery times) cost and the delivery cost for an integrated system of a single production machine and various transportation vehicles with transportation mode selection allowed. Each transportation mode is provided with a fixed number of vehicles at the associated delivery time and cost. The proposed problem is characterized as being NP-hard. Some solution properties are also characterized. Therewith, three heuristic algorithms (called SPT-based, LWF-based and WSPT-based heuristic) and a branch-and-bound algorithm are derived. In order to evaluate the effectiveness and efficiency of the proposed algorithms, computational experiments are made with some numerical instances.

Design of FIR Filters with Finite Precision Coefficients Using LP(Linear Programming) (선형계획을 이용한 유도 정밀도 계수 FIR 필터의 설계)

  • 조남익;이상욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.12
    • /
    • pp.2386-2396
    • /
    • 1994
  • In this paper, an optimal algorithm for the design of 1-D FIR filters with finite precision coefficients is proposed. The algorithm is based on the observation that the frequency constraints of a sub-problems(SP) in the branch and bound algorithm, which repeatedly use LP(linear programming), are closely related with those of neighboring SPs. By using the relationship between the SPs, the proposed algorithm reduces the number of constraints required for solving each SP with Lp, whereas the conventional algorithm employs all the constraints, which are required for solving the initial problem. Thus, the overall computational load for the design of FIR filters with finite precision coefficients is significantly alleviated, compared to the conventional branch and bound algorithm. Also, a new branching scheme for the design of FIR filters with sum-of-power-of-two(SOPOT) coefficients is proposed. It is shown that the computational load for the design fo SOPT coefficient filters can be further reduced with the new branching scheme.

  • PDF

Scheduling for a Two-Machine, M-Parallel Flow Shop to Minimize Makesan

  • Lee, Dong Hoon;Lee, Byung Gun;Joo, Cheol Min;Lee, Woon Sik
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.56
    • /
    • pp.9-18
    • /
    • 2000
  • This paper considers the problem of two-machine, M-parallel flow shop scheduling to minimize makespan, and proposes a series of heuristic algorithms and a branch and bound algorithm. Two processing times of each job at two machines on each line are identical on any line. Since each flow-shop line consists of two machines, Johnson's sequence is optimal for each flow-shop line. Heuristic algorithms are developed in this paper by combining a "list scheduling" method and a "local search with global evaluation" method. Numerical experiments show that the proposed heuristics can efficiently give optimal or near-optimal schedules with high accuracy. with high accuracy.

  • PDF

Transfer Batch Scheduling for a Flexible Flowshop with Identical Parallel Machines at Each Stage (다단계 병렬 흐름생산시스템에서 이송크기가 2이상인 경우의 제품별 로트 투입순서 결정)

  • ;F. Fred Choobineh
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.2
    • /
    • pp.33-46
    • /
    • 2000
  • The problem of scheduling n independent jobs on serial stages with identical parallel machines at each stage is considered. Each job lot is allocated evenly to all machines at each stage for processing and moved in transfer batches between states., This scheduling strategy is called an identical production pattern. The objective is to find a permutation schedule that minimizes makespan. A branch and bound algorithm is suggested to find an optimal permutation schedule for a transformed problem A number examples is presented to illustrate the branch and bound algorithm, Computational results for 640 problems generated randomly show that within a resonable time the suggested algorithm can be used for transfer batch scheduling in a flexible flowshop.

  • PDF

PCB 생산라인에서의 호이스트 스케쥴링을 위한 유전자알고리즘의 응용

  • 임준묵
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.1 no.1
    • /
    • pp.29-62
    • /
    • 1996
  • In this paper, the problem of determining cyclic schedules for a material handling hoist in the printed-circuit-board(PCB) electroplating line is considered. The objective of this research is to determine an optimal simple-cycle schedule of the hoist which in turn maximizes the line throughput rate. Previous approaches to the cyclic hoist scheduling problem are all mathematical programming-based approaches to develop cyclic schedules(Mixed Integer Programming, Linear Programming based Branch and Bound, Branch and Bound Search Method and so on). In this paper, a genetic algorithm-based approach for a single hoist scheduling in the PCB electroplating line is described. Through some experiments for the well known example data and randomly generated data, the proposed algorithm is shown to be more efficient than the previous mathematical programming-based algorithm.

Redundancy Optimization under Multiple Constraints (다제약식하에서의 최적중복설계에 관한 연구)

  • Yun Deok-Gyun
    • Journal of the military operations research society of Korea
    • /
    • v.11 no.2
    • /
    • pp.53-63
    • /
    • 1985
  • This paper presents a multi-costraint optimization model for redundant system reliability. The optimization model is usually formulated as a nonlinear integer programming (NIP) problem. This paper reformulates the NIP problem into a linear integer programming (LIP) problem. Then an efficient 'Branch and Straddle' algorithm is proposed to solve the LIP problem. The efficiency of this algorithm stems from the simultaneous handling of multiple variables, unlike in ordinary branch and bound algorithms. A numerical example is given to illustrate this algorithm.

  • PDF

A Study of Synthesis Algorithm for Component Mapping (콤포넌트 맵핑을 위한 합성 알고리즘에 관한 연구)

  • 김재진;이사원
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.4
    • /
    • pp.44-48
    • /
    • 1998
  • In this paper proposed Component Synthesis Algorithm(CSA) for mapping described HDL to RT component of given library. CSA transform I/O variables of HDL and relation of operators to control/data flow graph(CDFG) that consists of graph, reduce the size of graph, compute the cost, the bound, and the method that use compatibility graph(CG), and then mapping to component. Component synthesis used branch-and-bound algorithm. The result that synthesis using CSA algorithm was proved that this result and the cost of the manual were indentified.

  • PDF

An Algorithm for a Cardinality Constrained Linear Programming Knapsack Problem (선수제약 선형배낭문제의 해법연구)

  • 원중연
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.19 no.40
    • /
    • pp.137-142
    • /
    • 1996
  • An algorithm for solving the cardinality constrained linear programming knapsack problem is presented. The algorithm has a convenient structure for a branch-and-bound approach to the integer version, especially to the 0-1 collapsing knapsack problem. A numerical example is given.

  • PDF

Efficient Reverse Skyline Processing using Branch-and-Bound (분기한정법을 이용한 효율적인 리버스 스카이라인 질의 처리)

  • Han, Ah;Park, Young-Bae
    • Journal of KIISE:Databases
    • /
    • v.37 no.1
    • /
    • pp.12-21
    • /
    • 2010
  • Recently, "Service of information perspective" that is an important issue is that a company searches customers that interested in certain information and the company offers information to the customers. This service can gain high effects by low cost because of supporting selective information. In most recently, Reverse Skyline using Skyline Approximation(RSSA) is proposed to process services of information provider's perspective. RSSA has problem to defects about waste of processing time and memory. In this paper, Efficient Reverse Skyline(ERSL) Algorithm is proposed for Efficient processing the Skyline. ERSL is new Algorithm using Branch and Bound Skyline(BBS) reduces the waste of processing time and memory. When we execute the variety experimentation to valuation ERSL algorithm's capacity. It is proved the best efficient algorithm among the others because ERSL is flexibly kept the established capacity.

Scheduling Algorithms for the Maximal Total Revenue on a Single Processor with Starting Time Penalty

  • Joo, Un-Gi
    • Management Science and Financial Engineering
    • /
    • v.18 no.1
    • /
    • pp.13-20
    • /
    • 2012
  • This paper considers a revenue maximization problem on a single processor. Each job is identified as its processing time, initial reward, reward decreasing rate, and preferred start time. If the processor starts a job at time zero, revenue of the job is its initial reward. However, the revenue decreases linearly with the reward decreasing rate according to its processing start time till its preferred start time and finally its revenue is zero if it is started the processing after the preferred time. Our objective is to find the optimal sequence which maximizes the total revenue. For the problem, we characterize the optimal solution properties and prove the NP-hardness. Based upon the characterization, we develop a branch-and-bound algorithm for the optimal sequence and suggest five heuristic algorithms for efficient solutions. The numerical tests show that the characterized properties are useful for effective and efficient algorithms.