Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "mixed-integer programming" wg kryterium: Temat


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ł
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ł
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ł
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ł
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ł
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ł
Tytuł:
Modelling Set-up Times Overlapping Two Periods in the Proportional Lot-Sizing Problem with Identical Parallel Machines
Autorzy:
Kaczmarczyk, W.
Powiązania:
https://bibliotekanauki.pl/articles/375946.pdf
Data publikacji:
2013
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
production planning
lot-sizing and scheduling
mixed-integer programming
Opis:
This paper presents a new mixed integer programming model for the Proportional Lot-Sizing Problem (PLSP) with identical parallel machines and set-up times overlapping two periods. The proposed model assumes constant period length and explicitly calculates the distribution of set-up operations among periods. The presented results of computational experiments with standard mip methods prove that the untying set-ups from period borders enables the reduction of the total costs in optimal solutions.
Źródło:
Decision Making in Manufacturing and Services; 2013, 7, 1-2; 43-50
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Hybrid Models for the OWA Optimization
Autorzy:
Olender, P.
Powiązania:
https://bibliotekanauki.pl/articles/307934.pdf
Data publikacji:
2016
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
location problem
mixed-integer programming
mixed linear programming
multiple criteria
ordered weighted averaging
Opis:
When dealing with multicriteria problems, the aggregation of multiple outcomes plays an essential role in finding a solution, as it reflects the decision-maker's preference relation. The Ordered Weighted Averaging (OWA) operator provides a exible preference model that generalizes many objective functions. It also ensures the impartiality and allow to obtain equitable solutions, which is vital when the criteria represent evaluations of independent individuals. These features make the OWA operator very useful in many fields, one of which is location analysis. However, in general the OWA aggregation makes the problem nonlinear and hinder its computational complexity. Therefore, problems with the OWA operator need to be devised in an efficient way. The paper introduces new general formulations for OWA optimization and proposes for them some simple valid inequalities to improve efficiency. A hybrid structure of proposed models makes the number of binary variables problem type dependent and may reduce it signicantly. Computational results show that for certain problem types, some of which are very useful in practical applications, the hybrid models perform much better than previous general models from literature.
Źródło:
Journal of Telecommunications and Information Technology; 2016, 4; 22-30
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Partial coordination may increase overall costs in supply chains
Autorzy:
Kaczmarczyk, W.
Powiązania:
https://bibliotekanauki.pl/articles/375910.pdf
Data publikacji:
2008
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
supply chain
production
distribution
lot-sizing
coordination
mixed-integer programming
Opis:
This paper presents a computational study to evaluate the impact of coordinating production and distribution planning in a two-level industrial supply chain. Three planning methods are compared. The first emulates the traditional way of planning. The two other coordinate plans of the supplier and of all the buyers according to the Vendor Managed Inventory (VMI) approach. The monolithic method solves a single model describing the entire optimization problem. The sequential method copies the imperfect VMI practice. All three methods are implemented by means of Mixed Integer Programming models. The results presented prove that the right choice of planning method is very important for overall cost of the supply chain. In contrast to the previous research, it turned out that information sharing without full coordination may even lead to increase in the overall cost. For some companies applying the VMI approach, developing exact models and solving them almost optimally may therefore be very important.
Źródło:
Decision Making in Manufacturing and Services; 2008, 2, 1-2; 47-62
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Energy-saving Algorithms for the Control of Backbone Networks: A Survey
Autorzy:
Kamola, M.
Niewiadomska-Szynkiewicz, E.
Arabas, P.
Sikora, A.
Powiązania:
https://bibliotekanauki.pl/articles/307968.pdf
Data publikacji:
2016
Wydawca:
Instytut Łączności - Państwowy Instytut Badawczy
Tematy:
green routing
mixed-integer programming
OSPF heuristics
power-save networks
Opis:
The rapid growth of energy demand by wired IP networks can be mitigated on hardware and software levels. While upgrading to more efficient transmission media still brings biggest savings, we take a look here at power-saving algorithms that combine the capability of setting networking equipment in arbitrary energy states which, combined with profound knowledge of the network traffic matrix, leads to considerable complex optimization problem formulations. Alternatively, lightweighted heuristic approaches are presented, built on much simpler network model but still capable to perform energy-efficient traffic engineering.
Źródło:
Journal of Telecommunications and Information Technology; 2016, 2; 13-20
1509-4553
1899-8852
Pojawia się w:
Journal of Telecommunications and Information Technology
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The airport gate assignment problem – multi-objective optimization versus evolutionary multi-objective optimization
Autorzy:
Kaliszewski, I.
Miroforidis, J.
Stańczak, J.
Powiązania:
https://bibliotekanauki.pl/articles/305661.pdf
Data publikacji:
2017
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
airport gate assignment problem
Evolutionary Multi-objective Optimization
mixed-integer programming
Opis:
In this paper, we approach the Airport Gate Assignment Problem by Multi-objective Optimization as well as Evolutionary Multi-objective Optimization. We solve a bi-criteria formulation of this problem by the commercial mixed-integer programming solver CPLEX and a dedicated Evolutionary Multi-objective Optimization algorithm. To deal with multiple objectives, we apply a methodology that we developed earlier to capture decision-maker preferences in multi-objective environments. We present the results of numerical tests for these two approaches.
Źródło:
Computer Science; 2017, 18 (1); 41-52
1508-2806
2300-7036
Pojawia się w:
Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A mixed integer program for cyclic scheduling of flexible flow lines
Autorzy:
Sawik, T.
Powiązania:
https://bibliotekanauki.pl/articles/201462.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
flexible flow line
cyclic scheduling
cyclic-batch scheduling
mixed-integer programming
Opis:
A new mixed integer programming formulation is presented for cyclic scheduling in flow lines with parallel machines and finite in-process buffers, where a Minimal Part Set (MPS) in the same proportion as the overall production target is repetitively scheduled. The cycle of parts in an MPS is not determined a priori, but is obtained along with the optimal schedule for all parts. In addition to the cyclic scheduling, a cyclic-batch scheduling mode is introduced, where within the MPS the parts of one type are processed consecutively. Numerical examples are included and some results of computational experiments are reported.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 1; 121-128
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Conflict Management in University Examination Timetabling Problem: A case study of summer school mid-terms
Autorzy:
Bayar, Mustafa Mehmet
Uzun Bayar, Irmak
Powiązania:
https://bibliotekanauki.pl/articles/14147915.pdf
Data publikacji:
2020-09-20
Wydawca:
Wyższa Szkoła Bankowa we Wrocławiu
Tematy:
examination timetabling
group decision making
lexicographic optimization
linear mixed integer programming
Opis:
Abstract: Aim: This study is on tackling Examination Timetabling Problem (ETP) of the Faculty of Economics And Administrative Sciences (FEAS) of the Ankara HBV University summer school, where the courses of fall and spring semesters are offered simultaneously and regulations on restricting enrollments in inter-department electives or in-department courses of distinct years are relaxed. Thus, the complexity of the nature of the ETP problem is exacerbated. The direct heuristics based on successive assignments that the university normally adopts was proven inadequate for assuming standard regulations hence, another approach we explain in this paper was needed. Design / Research methods: The ETP was formulated as a Linear Mixed-Integer Program (LMIP) and decomposed into three stages; timetabling exams, room assignment, student allocation. To manage the conflict between the stakeholders of the examination procedure, a lexicographic optimization process based on the priority of the parties was undertaken. Conclusions / findings: After a recursive timetabling process based on a trial-and-error method a clash-free timetable was generated and, a room assignment plan that minimizes the total number of proctoring duties, usage of higher floor rooms and total crowdedness of rooms respectively was put into action. Therefore no student group experienced any clashing exams, the faculty members saved time that can be spent on research instead, since the room usage was better planned the costs (elevator usage, lighting, air conditioning, the labor of the janitors) were assumed to be decreased. Originality / value of the article: Each examination period bares a different ETP due to its problem-specific nature (number of courses offered, structure of student enrollments, availability of rooms, etc.). Summer schools provide a more irregular structure that demands special attention, a trial-and-error reformulation of the ETP in our case. In addition, the traditional formulations of the ETP, to the extent we have been able to scan, do not include the minimization of the crowdedness of the rooms. Thus, in creating a more comfortable environment, easier to monitor exams and, ability in handling unexpected dysfunctionalities (broken classroom equipment, etc.) this study is novel. Limitations of the research: The algorithms to solve an ETP formulated as an LMIP are of high complexity therefore, we are not able to assert the optimality of our suggested solutions acquired within time limitations. Keywords: examination timetabling, group decision making, lexicographic optimization, linear mixed-integer programming JEL: C44, C61, M12
Źródło:
Central European Review of Economics and Management; 2020, 4, 3; 67-87
2543-9472
Pojawia się w:
Central European Review of Economics and Management
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A New Mathematical Model for Multisession Exams-Building Assignment
Autorzy:
Ergul, Z.
Kamisli Ozturk, Z.
Powiązania:
https://bibliotekanauki.pl/articles/1031701.pdf
Data publikacji:
2017-09
Wydawca:
Polska Akademia Nauk. Instytut Fizyki PAN
Tematy:
Educational timetabling
Examination-building assignment
Multi objective nonlinear optimization
Mixed Integer Programming
Opis:
The educational timetabling problem has been extensively investigated in timetabling literature. However, the problem of assigning exams to examination buildings has not been studied intensively by researchers. We were inspired by Open and Distance Education System exams of Anadolu University. Anadolu University Open and Distance Education System, which is used by approximately two millions of students and has more than two millions of graduates, is a well-known institution in Turkey. In this study, we propose a multi-objective mathematical model for multisession exam-building assignment problem. Objective functions of this model are to minimize the distance between consecutive session buildings for a given student, to maximize the number of occupants of buildings in every session and to minimize the variety of booklets for building in every session. Mathematical model has been found inadequate because students-examination building assignment in the Anadolu University Open Education system is a large size real life problem. Starting from this point of view, an order-based multi-objective heuristic algorithm is developed to solve this problem. The solutions obtained by the proposed algorithm are compared with the solution obtained by the mathematical modelling and the current state of the existing system.
Źródło:
Acta Physica Polonica A; 2017, 132, 3; 1207-1210
0587-4246
1898-794X
Pojawia się w:
Acta Physica Polonica A
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An incremental approach for storage and delivery planning problems
Autorzy:
Sakakibara, K.
Tian, Y.
Nishikawa, I.
Powiązania:
https://bibliotekanauki.pl/articles/375942.pdf
Data publikacji:
2012
Wydawca:
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
Tematy:
simultaneous optimization
logistic terminal
consolidate shipment
mixed-integer programming
relax-and-fix
Opis:
We consider a logistic planning problem for simultaneous optimization of the storage and the delivery. This problem arises in the consolidate shipment using an intermediate storage in a supply chain, which is typically found in the automobile industry. The vehicles deliver the items from the origin to the destination, while the items can be stored at some warehousing facilities as the intermediate storage during the delivery. The delivery plan is made for each day separately, but the storage at a warehouse may last for more than one day. Therefore, the entire logistic plan should be considered over a certain period for the total optimization. We formulate the storage and delivery problem as a mixed integer programming. Then, we propose a relax-and-fix type heuristic method, which incrementally fixes decision variables until all the variables are fixed to obtain a complete solution. Moreover, a semiapproximate model is introduced to effectively fix the variables. Based on the formulation, the delivery plan can be solved for each day separately. This has the advantage especially in the dynamic situation, where the delivery request is modified from the original request before the actual delivery day. Numerical experiments show that the simultaneous optimization gives the effective storage plan to reduce the total logistic cost, and the proposed heuristics efficiently reduce the computational time and are robust against the dynamic situation.
Źródło:
Decision Making in Manufacturing and Services; 2012, 6, 1-2; 5-23
1896-8325
2300-7087
Pojawia się w:
Decision Making in Manufacturing and Services
Dostawca treści:
Biblioteka Nauki
Artykuł

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies