AN ASSIGNMENT PROBLEM ON A NETWORK
スポンサーリンク
概要
- 論文の詳細を見る
This paper deals with a problem of assigning n persons to n nodes (jobs) in a given network, whose arc lengths are dependent upon the assignment, so that the length of a critical path in the network may be minimized. The problem is first formulated as an integer programming probem, and then a branch-and-bound algorithm is proposed. The algorithm makes use of lower bounds obtained from the generated LP (linear programming) problems. Each LP problem is efficiently solved by reducing them to a series of rather small LP problems with two types of auxiliary problems : the ordinary assignment problems and the critical path problems.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Mine Hisashi
Department Of Applied Mathematics And Physics Faculty Of Engineering Kyoto University
-
Ibaraki Toshihide
Department Of Applied Mathematics And Physics Faculty Of Engineering Kyoto University
-
Ishii Hiroaki
Department Of Applied Mathematics And Physics Faculty Of Engineering Kyoto University
-
MINE HISASHI
Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University
-
IBARAKI TOSHIHIDE
Department of Applied Mathematics and Physics, Faculty of Engineering, Kyoto University
関連論文
- 8B1 PRODUCTION PLANNING SYSTEM FOR IMPLEMENTING MASS CUSTOMIZATION BY USING PARTICLE SWARM OPTIMIZATION(Technical session 8B: Customer orientation)
- 7B2 PROPOSAL OF COLLABORATION IN SUPPLY CHAIN FOR IMPLEMENTING MASS CUSTOMIZATION(Technical session 7B: Supply chain)
- Proposal of Heuristic Algorithm for Scheduling of Print Process in Auto Parts Supplier(Advanced Production Scheduling)
- 6B2 AN ITERATED LOCAL SEARCH ALGORITHM FOR THE MULTI-RESOURCE GENERALIZED ASSIGNMENT PROBLEM WITH FLEXIBLE ASSIGNMENT COST(Technical session 6B: General model for scheduling and assignment problem)
- A Simple Proof of a Minimum Cut Algorithm and Its Applications
- A Randomness Based Analysis on the Data Size Needed for Removing Deceptive Patterns
- LINEAR PROGRAMMING PROBLEM WITH FUZZY RANDOM CONSTRAINT
- FUZZY TWO-STAGE PROBLEM BY POSSIBILITY MEASURE
- AN ITERATION METHOD FOR NONLINEAR PROGRAMMING PROBLEMS : II
- ITERATION METHOD FOR SOLVING NONLINEAR PROGRAMMING PROBLEMS WITH EQUALITY AND INEQUALITY CONSTRAINTS
- A GENERAL NEWTON METHOD FOR SYSTEMS OF NONLINEAR EQUATIONS II
- 4A1 A LOCAL SEARCH ALGORITHM FOR ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW AND TRAVELING TIME CONSTRAINTS(Technical session 4A : Vehicle routing)
- A Note on Approximating the Survivable Network Design Problem in Hypergraphs(Special Issue on Selected Papers from LA Symposium)
- An LP-Based Local Search to the One Dimensional Cutting Stock Problem Using a Given Number of Cutting Patterns
- Construction of Classifiers by Iterative Compositions of Features with Partial Knowledge(Discrete Mathematics and Its Applications)
- FUZZY SCHEDULING PROBLEM ON A MULTIPROCESSOR SYSTEM WITH MEMORIES
- ALGORITHMS FOR QUADRATIC FRACTIONAL PROGRAMMING PROBLEMS
- A Fast Algorithm for Cactus Representations of Minimum Cuts
- Solving the Single-Vehicle Scheduling Problems for All Home Locations under Depth-First Routing on a Tree (Special Section on Discrete Mathematics and Its Applications)
- 1-F-8 Optimal Allocation of Human Resource Practices with AHP/DEA(General Session(2))
- VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS
- PA2-2 Relationship between Blood Lactate and Hyperventilation during High Intensity Constant Load Exercise in Heat Condition(Proceedings of The 8th International Congress of Physiological Anthropology)
- 1A1 Scheduling of Corrugated Paper Production(Technical session 1A: Combinatorial optimization)
- A PRIMAL CUTTING PLANE ALGORITHM FOR INTEGER FRACTIONAL PROGRAMMING PROBLEMS
- AN ASSIGNMENT PROBLEM ON A NETWORK
- MINIMUM DELAY SEMIJOIN SCHEDULES FOR LOCAL AREA DISTRIBUTED DATABASE SYSTEMS(Mathematical Theories on Computing Schemes and Their Applications)
- Approximability of the Minimum Maximal Matching Problem in Planar Graphs(Graphs and Networks)
- A COMPETITIVE FACILITY LOCATION PROBLEM WITH ESTABLISHING COST
- An Approximation of the Minimum Vertex Cover in a Graph
- Line thinning fosters the abundance and diversity of understory Hymenoptera (Insecta) in Japanese cedar (Cryptomeria japonica D. Don) plantations
- MARGINAL CHECKING OF A MARKOVIAN DEGRADATION UNIT WHEN CHECKING INTERVAL IS PROBABILISTIC
- Minimum Self-Dual Decompositions of Positive Dual-Minor Boolean Functions
- Intermittency Caused by Chaotic Modulation. II : Lyapunov Exponent, Fractal Structure and Power Spectrum : General of Theoretical Physics
- SINGLE MACHINE BATCHING PROBLEM TO MINIMIZE THE SUM OF COMPLETION TIMES WITH NUMBER OF BATCHES AND BATCH SIZE LIMITATIONS
- ON THE COMPUTATIONAL EFFICIENCY OF BRANCH-AND-BOUND ALGORITHMS
- PARTIALLY DEFINED BOOLEAN FUNCTIONS WITH APPLICATIONS TO DATA ANALYSIS : A SURVEY
- Glucose-incretin interaction revisited
- Aboveground productivity of an unsuccessful 140-year-old Cryptomeria japonica plantation in northern Kyushu, Japan
- PERISHABLE INVENTORY PROBLEM WITH TWO TYPES OF CUSTOMERS AND DIFFERENT SELLING PRICES
- EXTENSION OF SPANNING TREE AND APPLICATIONS
- An Evaluation of Long-Term Results over 10 Years after Intracardiac Repair of Tetralogy of Fallot.
- Proposal of Load Leveling Model for Implementing Mass Customization in Automobile Industry
- A new experimental model of ATP-sensitive K^+ channel-independent insulinotropic action of glucose : a permissive role of cAMP for triggering of insulin release from rat pancreatic β-cells