One approach to solving a discrete production planning problem with interval data

被引：0
|
作者：
M. V. Devyaterikova
A. A. Kolokolov
A. P. Kolosov
机构：
[1] Siberian Division of the Russian Academy of Sciences,Omsk Branch of the Sobolev Institute of Mathematics
来源：
Proceedings of the Steklov Institute of Mathematics | 2008年 / 263卷
关键词：
STEKLOV Institute; Linear Programming Problem; Knapsack Problem; Interval Data; Integer Point;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we develop an approach to solving integer programming problems with interval data based on using the possibilities of varying the relaxation set of the problem. This is illustrated by means of an L-class enumeration algorithm for solving a dicrete production planning problem. We describe the algorithm and a number of its modifications and present results of a computational experiment for families of problems from the OR Library and with randomly generated initial data. This approach is also applied to obtain approximate solutions of the mentioned problem in its conventional setting.
引用
收藏
页码：37 / 46
页数：9
相关论文
共 50 条
  • [1] One approach to solving a discrete production planning problem with interval data
    Devyaterikova, M. V.
    Kolokolov, A. A.
    Kolosov, A. P.
    TRUDY INSTITUTA MATEMATIKI I MEKHANIKI URO RAN, 2008, 14 (02): : 48 - 57
  • [2] One Approach to Solving a Discrete Production Planning Problem with Interval Data
    Devyaterikova, M. V.
    Kolokolov, A. A.
    Kolosov, A. P.
    PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2008, 263 (Suppl 2) : S37 - S46
  • [3] An Approach for Solving Fully Interval Production Planning Problems
    Figueroa Garcia, Juan Carlos
    Franco, Carlos
    FUZZY INFORMATION PROCESSING 2020, 2022, 1337 : 267 - 276
  • [4] Solving Robust Production Planning Problem with Interval Budgeted Uncertainty in Cumulative Demands
    Kasperski, Adam
    Zielinski, Pawel
    VIETNAM JOURNAL OF COMPUTER SCIENCE, 2022, 09 (03) : 285 - 296
  • [5] Hybrid approach for solving the integrated planning and scheduling production problem
    Ibn Majdoub Hassani, Zineb
    El Barkany, Abdellah
    Jabri, Abdelouahhab
    El Abbassi, Ikram
    Darcherif, Abdel Moumen
    JOURNAL OF ENGINEERING DESIGN AND TECHNOLOGY, 2020, 18 (01) : 172 - 189
  • [6] On solving stochastic production planning problem
    Meybodi, MZ
    DECISION SCIENCES INSTITUTE, 1997 ANNUAL MEETING, PROCEEDINGS, VOLS 1-3, 1997, : 902 - 904
  • [7] A NEW APPROACH FOR SOLVING THE MINIMUM COST FLOW PROBLEM WITH INTERVAL AND FUZZY DATA
    Ghiyasvand, Mehdi
    INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2011, 19 (01) : 71 - 88
  • [8] Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates
    Liu, Jianing
    Lv, Kewei
    INFORMATION AND COMMUNICATIONS SECURITY, ICICS 2017, 2018, 10631 : 75 - 80
  • [9] L-class enumeration algorithms for a discrete production planning problem with interval resource quantities
    Devyaterikova, M. V.
    Kolokolov, A. A.
    Kolosov, A. P.
    COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (02) : 316 - 324
  • [10] Modeling and Solving the Practical Production Planning Problem
    Li, Shaorui
    Kubo, Mikio
    2009 INTERNATIONAL CONFERENCE ON COMPUTER AND AUTOMATION ENGINEERING, PROCEEDINGS, 2009, : 142 - +
12345