• 대한수학회지
• /
• 제47권6호
• /
• pp.1223-1238
• /
• 2010

The purpose of this work is to identify the internal structure of the electrical networks with data obtained from only a part of network or the boundary of network. To be precise, it is discussed whether we can identify resistors or electrical conductivities of each link inside networks by the measurement of voltage on the boundary which is induced by a prescribed current on the boundary. As a result, it is shown that the structure of the resistor network can be determined uniquely by only one pair of the data (current, voltage) on the boundary, if the resistors satisfy an appropriate condition. Besides, several useful results about the energy functionals, which means the electrical power, are included.

• Industrial Engineering and Management Systems
• /
• 제8권4호
• /
• pp.239-246
• /
• 2009

This paper deals with the makespan minimization problem of job shops. The problem is known as one of hard problems to optimize, and therefore, many heuristic methods have been proposed by many researchers. The aim of this study is also to propose a heuristic scheduling method for the problem. However, the difference between the proposed method and many other heuristics is that the proposed method is based on depth-first branch and bound, and thus it is possible to find an optimal solution at least in principle. To accelerate the search, when a node is judged hopeless in the search tree, the proposed flexible branch and bound method can indicate a higher backtracking node. The unexplored nodes are stored and may be explored later to realize the strict optimization. Two methods are proposed to generate the backtracking point based on the critical path of the current best feasible schedule, and the minimum lower bound for the makespan in the unexplored sub-problems. Schedules are generated based on Giffler and Thompson's active schedule generation algorithm. Acceleration of the search by the flexible branch and bound is confirmed by numerical experiment.