Wszystkie pola: Integer programming - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Mixed Integer Programming Approaches to Planning and Scheduling in Electronics Supply Chains
Autorzy:: Sawik, T.
Powiązania:: https://bibliotekanauki.pl/articles/375874.pdf
Data publikacji:: 2017
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: electronics supply chains
planning and scheduling
mixed integer programming
Opis:: This paper discusses mixed-integer programming (MIP) approaches to planning and scheduling in electronics supply chains. First, the short-term detailed scheduling of wafer fabrication in semiconductor manufacturing and detailed scheduling of printed wiring board assembly in surface mount technology lines are discussed. Then, the medium-term aggregate production planning in a production/assembly facility of a consumer electronics supply chain is described; and finally, the coordinated aggregate planning and scheduling of the manufacturing and supply of parts and production of the finished products is presented. The decision variables are defined, and the MIP modeling frameworks are provided. Two decisionmaking approaches are discussed and compared: an integrated (simultaneous) approach, in which all required decisions are made simultaneously using a complex, large monolithic MIP model; and a hierarchical (sequential) approach, in which the required decisions are made successively using the hierarchies of simpler and smaller-sized MIP models. The paper also highlights the research on stochastic MIP applications to the planning and scheduling in electronics supply chains with disrupted material and information flows due to natural or man-made disasters.
Źródło:: Decision Making in Manufacturing and Services; 2017, 11, 1-2; 5-17
1896-8325
2300-7087
Pojawia się w:: Decision Making in Manufacturing and Services
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Właściwości programowej realizacji zadania programowania całkowitoliczbowego
Look-and-feel realization of integer programming problems
Autorzy:: Ostanin, A.
Wasiluk, J.
Powiązania:: https://bibliotekanauki.pl/articles/341141.pdf
Data publikacji:: 2008
Wydawca:: Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:: programowanie całkowitoliczbowe
metoda gałęzi i granic
decyzja o rozgałęzieniu
integer programming
branch-and-bound method
deciding whether to branch
Opis:: Praca poświęcona jest problemom realizacji nowej optymalizacyjnej funkcji bintprog jako nieodłącznej części Optimization Toolbox 3.0 programowego pakietu MATLAB 7. Wprowadzenie nowej funkcji istotnie poszerza skalę rozwiązywanych optymalizacyjnych zadań, ponieważ potwierdza fakt realizowania metody gałęzi i granic. Badanie tej metody wchodzi w skład programu wielu uczelnianych kursów i daje podstawędo rozwiązywania większości zadań programowania całkowitoliczbowego. Na zakończenie podano przykłady niektórych reprezentatywnych wyników uzyskanych w badaniach.
The paper is dedicated to the problems of realization a new optimization function bintprog as inseparable part of Optimization Toolbox 3.0, pack MATLAB 7. Introduction of the new function essentially extends the scale of optimization assignments that should be solved, because it confirms the fact of realizing the branch-and-bound method. Investigation of this methods is included in many of educational courses and gives base to solving most of integer programming problems. Some representative results of tests are given at the end of the paper.
Źródło:: Zeszyty Naukowe Politechniki Białostockiej. Informatyka; 2008, 3; 97-110
1644-0331
Pojawia się w:: Zeszyty Naukowe Politechniki Białostockiej. Informatyka
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Mixed-integer programming formulations for the truck scheduling problem with fixed outbound departures
Rozwiązywanie problemu harmonogramowania przewozów przy ustalonych załadunkach
Autorzy:: Wolff, Pascal
Huo, Jiazhen
Pfohl, Hans-Christian
Powiązania:: https://bibliotekanauki.pl/articles/1835497.pdf
Data publikacji:: 2021
Wydawca:: Wyższa Szkoła Logistyki
Tematy:: cross-docking
truck scheduling
mixed-integer programming
logistics
optimization
harmonogramowanie przewozów
programowanie różnych zmiennych
logistyka
optymalizacja
Opis:: Truck scheduling at cross-docking terminals has received much academic attention over the last three decades. A vast number of mixed-integer programming models have been proposed to assign trucks to dock-doors and time slots. Surprisingly, only a few models assume fixed outbound truck departures that are often applied in the less-than-truckload or small parcel and express delivery industry. To the best of our knowledge, none of these papers explore whether a discrete-time or continuous-time model formulation has a better computational performance. This paper attempts to close this research gap and tries to shed light on which type of formulation is advantageous. Therefore, a variant of the truck scheduling problem with fixed outbound departures is considered. This problem's objective is to find a feasible truck schedule that minimizes the number of delayed freight units. Methods: We propose two model formulations for the described variant of the truck scheduling problem with fixed outbound departures. Specifically, the problem is formulated as a discrete-time and a continuous-time mixed-integer programming model. Results: A computational experiment is conducted in order to assess the computational performance of the presented model formulations. We compare the discrete-time and continuous-time formulation in terms of both the solution quality and computational time. Conclusions: The computational results show that the proposed discrete-time model formulation can solve problem instances of medium size to proven optimality within less than one minute. The continuous-time model formulation, on the other hand, can solve small instances to optimality. However, it requires longer solution times than the discrete-time formulation. Furthermore, it is unable to solve medium-sized instances within a 5-minute time limit. Thus, it can be summarized that the proposed discrete-time model formulation is clearly superior to the continuous-time model formulation.
Harmonogramowanie przewozów oraz cross-dockingu leży w zasięgu zainteresowania uczonych już od ponad 30 lat. W tym okresie zaproponowało wiele różnych modeli programistycznych tablic awizacyjnych. Jednak zaledwie kilka modeli bierze pod uwagę stałe załadunki, które często są stosowane w przewozach niepełno samochodowych oraz kurierskich. Według naszego rozeznania, żaden z dostępnych modeli nie stosuje modelowania czasem w sposób dyskretny lub ciągły dla uzyskania lepszego wyniku. Celem pracy jest uzupełnienie tej luki w badaniach. Dlatego też rozważono wariant problemu harmonogramowania przewozów ze stałymi załadunkami z celem nadrzędnym znalezienia takiego sposobu harmonogramowania aby minimalizował on liczbę opóźnionych przewozów. Metody: Zaproponowano dwa modele, opisujące harmonogramowanie przewozów ze stałymi załadunkami. Problem ten został sformułowany poprzez model programistyczny ze zmienną czasu w ujęciu dyskretnym i ciągłym. Wyniki: Przeprowadzono symulację komputerową w celu określenie działania opracowanych modeli. Porównano wyniki pod względem jakości uzyskanego wyniku oraz niezbędnego czasu dla obliczeń. Wnioski: Na podstawie uzyskanych wyników można stwierdzić, że proponowany model dyskretny może rozwiązywać problem średniej wielkości w czasie niższej niż minuta. Model oparty na czasie ciągłym uzyskał z kolei optymalizację przy małych przypadkach. Wymagało to jednak dłuższego czasu obliczeniowego. Dodatkowo nie uzyskano dla rozwiązań średniej wielkości czasu niższego od 5 minut. Dlatego też wysunięto wniosek, że model dyskretny jest lepszym w porównaniu z modelem ciągłym.
Źródło:: LogForum; 2021, 17, 2; 243--251
1734-459X
Pojawia się w:: LogForum
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 4.

Tytuł:: Stochastic algorithms in discrete optimization with noisy values for the function
Autorzy:: Wieczorkowski, Robert
Powiązania:: https://bibliotekanauki.pl/articles/747459.pdf
Data publikacji:: 1995
Wydawca:: Polskie Towarzystwo Matematyczne
Tematy:: Stochastic programming
Mathematical programming methods
Integer programming
Opis:: .
The paper deals with stochastic methods for searching approximately global minimum of function defined on discrete set. A measure of quality of solution is defined to compare different algorithms. Simple Monte Carlo method is analysed as main algorithm for which formulas dealing with the measure of quality are derived(two cases: exact values and noisy values of function). This Monte Carlo method is used as a base in simulation experiments for comparing other stochastic algorithms. The second part of the paper analyses asymptotic properties of the generalised simulated annealing algorithms. Theory of Markov chains is used in modelling this class of algorithms. Theorems about convergence of the records of algorithms to set of optima with probability one are presented in the case of function having random noisy values. The paper also reviews known results in the field of simulated annealing type algorithms for function with randomly perturbated values.
Źródło:: Mathematica Applicanda; 1995, 24, 38
1730-2668
2299-4009
Pojawia się w:: Mathematica Applicanda
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 5.

Tytuł:: Explicit modeling of multi-period setup times in proportional lot-sizing and scheduling problem with variable capacity
Autorzy:: Kaczmarczyk, Waldemar
Powiązania:: https://bibliotekanauki.pl/articles/2083469.pdf
Data publikacji:: 2021
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: production
lot-sizing
scheduling
mixed-integer programming
Opis:: Small bucket models with many short fictitious micro-periods ensure high-quality schedules in multi-level systems, i.e., with multiple stages or dependent demand. In such models, setup times longer than a single period are, however, more likely. This paper presents new mixed-integer programming models for the proportional lot-sizing and scheduling problem (PLSP) with setup operations overlapping multiple periods with variable capacity. A new model is proposed that explicitly determines periods overlapped by each setup operation and the time spent on setup execution during each period. The model assumes that most periods have the same length; however, a few of them are shorter, and the time interval determined by two consecutive shorter periods is always longer than a single setup operation. The computational experiments show that the new model requires a significantly smaller computation effort than known models.
Źródło:: Archives of Control Sciences; 2021, 31, 4; 883-912
1230-2384
Pojawia się w:: Archives of Control Sciences
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 6.

Tytuł:: Quantitative approach to project portfolio management: proposal for Slovak companies
Autorzy:: Kral, Pavol
Valjaskova, Viera
Janoskova, Katarina
Powiązania:: https://bibliotekanauki.pl/articles/19107981.pdf
Data publikacji:: 2019
Wydawca:: Instytut Badań Gospodarczych
Tematy:: mathematical model
integer programming
optimization
project portfolio
Opis:: Research background: Project portfolio optimization isa demanding process in the case of considering a large number of project intentions and has so far been the subject of research by many authors, especially foreign authors. However, the issue of project portfolio optimization is an area that is not sufficiently addressed by Slovak authors. This was the main impulse to create a specific mathematical model of integer programming with bivalent variables to optimize the company's project portfolio with the intention to reflect the specific requirements of Slovak companies. Purpose of the article: The aim of the article is to propose a mathematical model of integer programming with bivalent variables to optimize the project portfolio with a focus on Slovak companies. Methods: In accordance with the aim of the article, a questionnaire survey was carried out with the intention of identifying the criteria that are perceived by the managers of Slovak companies as important in the optimization of the project portfolio. These criteria were subsequently reflected in the mathematical model design using the mathematical programming method. Findings & Value added: Based on a literature review aimed at the project portfolio optimization, we have found a gap in considering the compliance of project intentions and strategic objectives of the company within the optimization of the project portfolio. Based on the results of the questionnaire survey, the significance of the mutual compliance of project intentions with the strategic objectives of the company was confirmed from the point of view of Slovak companies. Given the fact that our aim was to create an innovative integer programming model with bivalent variables orientated to the conditions of Slovak companies, we included in the resulting model the criteria that were not considered within the scope of existing research in this area, and which are perceived as important by the Slovak companies.
Źródło:: Oeconomia Copernicana; 2019, 10, 4; 797-814
2083-1277
Pojawia się w:: Oeconomia Copernicana
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 7.

Tytuł:: Practical tips for modelling Lot-Sizing and Scheduling Problems
Autorzy:: Kaczmarczyk, W.
Powiązania:: https://bibliotekanauki.pl/articles/375896.pdf
Data publikacji:: 2009
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: production
lot-sizing and scheduling
mixed-integer programming
Opis:: This paper presents some important alternatives for modelling Lot-Sizing and Scheduling Problems. First, the accuracy of models can improved by using short time buckets, which allow more detailed planning but lead to higher computational effort. Next, valid inequalities make the models tighter but increase their size. Sometimes it is possible to find a good balance between the size and tightness of a model by limiting a priori the number of valid inequalities. Finally, a special normalization of the variables simplifies the presentation of results and validation of models.
Źródło:: Decision Making in Manufacturing and Services; 2009, 3, 1-2; 37-48
1896-8325
2300-7087
Pojawia się w:: Decision Making in Manufacturing and Services
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 8.

Tytuł:: Modelling multi-period set-up times in the Proportional Lot-Sizing Problem
Autorzy:: Kaczmarczyk, W.
Powiązania:: https://bibliotekanauki.pl/articles/375894.pdf
Data publikacji:: 2009
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: production
lot-sizing and scheduling
mixed-integer programming
Opis:: This paper presents new mixed integer programming models for the Proportional Lot-Sizing Problem (PLSP) with set-up times longer than a period. Proposed models explicitly calculate the distribution of times amongst products in periods with a changeover and determine a final period for every set-up operation. Presented results prove that the proposed models are easier to solve using standard MIP methods than already known models.
Źródło:: Decision Making in Manufacturing and Services; 2009, 3, 1-2; 15-35
1896-8325
2300-7087
Pojawia się w:: Decision Making in Manufacturing and Services
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 9.

Tytuł:: Overlay Multicast Optimization : IBM ILOG CPLEX
Autorzy:: Kucharzak, M.
Zydek, D.
Poźniak-Koszałka, I.
Powiązania:: https://bibliotekanauki.pl/articles/226362.pdf
Data publikacji:: 2012
Wydawca:: Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:: overlay multicast
maximum flows
linear programming
mixed-integer programming
Opis:: IBM ILOG CPLEX Optimization Studio delivers advanced and complex optimization libraries that solve linear programming (LP) and related problems, e.g., mixed integer. Moreover, the optimization tool provides users with its Academic Research Edition, which is available for teaching and noncommercial research at no-charge. This paper describes the usage of CPLEX C++ API for solving linear problems and, as an exhaustive example, optimization of network flows in overlay multicast is taken into account. Applying continuous and integral variables and implementing various constraints, including equations and inequalities, as well as setting some global parameters of the solver are presented and widely explained.
Źródło:: International Journal of Electronics and Telecommunications; 2012, 58, 4; 381-388
2300-1933
Pojawia się w:: International Journal of Electronics and Telecommunications
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 10.

Tytuł:: Optimizing modular machining line design problem with mixed activation mode of machining units
Autorzy:: Belmokhtar, S.
Dolgui, A.
Delorme, X.
Ignatenko, I.
Powiązania:: https://bibliotekanauki.pl/articles/375904.pdf
Data publikacji:: 2007
Wydawca:: Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:: modular machining line
cost optimization
mixed-integer programming
Opis:: A modular transfer line designing problem is investigated. The problem is to find the best subset of modules (machining units) from a given set and to assign them to different stations so that technological constraints and cycle upper limit are respected and the line cost is minimal. The investigated lines have a mixed activation mode for the machining units of each station, i. e. the units of each station are arranged into a series of stages such that each stage is composed of several units activated in parallel. A mixed integer program approach is proposed to model and solve the corresponding design problem. Improvements are suggested in order to reduce the model size and speed up the computations.
Źródło:: Decision Making in Manufacturing and Services; 2007, 1, 1-2; 35-48
1896-8325
2300-7087
Pojawia się w:: Decision Making in Manufacturing and Services
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "Integer programming" wg kryterium: Wszystkie pola

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język