نتایج جستجو برای: mixed integer linear programming milp

تعداد نتایج: 989059  

In this paper, a hybrid multi-criteria decision-making (MCDM)-method and mixed integer linear programming (MILP) approach in order to evaluation of the returned products' collectors along with their ordered quantities, is utilized. Firstly, the most important criteria of collection center in the car industry are identified. Then, in order to evaluate these proposed criteria, a hybrid Fuzzy Deci...

Journal: :JORS 2016
Asef Nazari Dhananjay R. Thiruvady Aldeida Aleti Irene Moser

Component deployment is a combinatorial optimisation problem in software engineering that aims at finding the best allocation of software components to hardware resources in order to optimise quality attributes, such as reliability. The problem is often constrained due to the limited hardware resources, and the communication network, which may connect only certain resources. Due to the non-line...

Journal: :Computers & Chemical Engineering 2006
Pedro M. Castro Ignacio E. Grossmann

This paper presents a multiple time grid continuous time MILP model for the short-term scheduling of single stage, multiproduct batch plants where the objective is the minimization of total cost or total earliness. It can handle both release and due dates and it can determine the products delivery dates explicitly if these need to be considered in the objective function. This formulation is com...

Journal: :Computers & Chemical Engineering 2016
Ezra Wari Weihang Zhu

This paper presents a multi-week mixed integer linear programming (MILP) scheduling model for an ice cream processing facility. The ice cream processing is a typical complex food manufacturing process and a simplified version of this processing has been adapted to investigate scheduling problems in the literature. Most of these models only considered the production scheduling for a week. In thi...

Journal: :IEEE Trans. on CAD of Integrated Circuits and Systems 2000
Krishnendu Chakrabarty

We present optimal solutions to the test scheduling problem for core-based systems. Given a set of tasks (test sets for the cores), a set of test resources (e.g., test buses, BIST hardware) and a test access architecture, we determine start times for the tasks such that the total test application time is minimized. We show that the test scheduling decision problem is equivalent to the -processo...

Journal: :Discrete Event Dynamic Systems 2009
Avenir Kobetski Martin Fabian

Automation and flexibility are often mentioned as key concepts in modern production industry. To increase the level of flexibility, deterministic finite automata (DFA) can be used to model, specify and verify the production systems. Often, it is also desirable to optimize some production criteria, such as for example the cycle time of a manufacturing cell. In this paper, a method for automatic ...

1999
Krishnendu Chakrabarty

We present optimal solutions to the test scheduling problem for core-based systems. We show that test scheduling is equivalent to the m-processor open-shop scheduling problem and is therefore NP-complete. However, a commonly-encountered instance of this problem (m = 2) can be solved in polynomial time. For the general case (m > 2), we present a mixed-integer linear programming (MILP) model for ...

Journal: :international journal of industrial mathematics 2015
sh. razavyan

this paper uses the weighted l$_1-$norm to propose an algorithm for finding a well-dispersed subset of non-dominated solutions of multiple objective mixed integer linear programming problem. when all variables are integer it finds the whole set of efficient solutions. in each iteration of the proposed method only a mixed integer linear programming problem is solved and its optimal solutions gen...

2010
Yossi Bukchin Michal Tzur

In this paper we propose a new approach for the facility layout problem (FLP) and suggest new mixed-integer linear programming (MILP) formulations. The proposed approach considers simultaneously the location of the departments within the facility and the internal arrangement of the machines. Two models are suggested, where the first addresses the rectangular department case and the second allow...

Journal: :IBM Journal of Research and Development 2007
Jon Lee

We examine various aspects of modeling and solution via mixedinteger nonlinear programming (MINLP). MINLP has much to offer as a powerful modeling paradigm. Recently, significant advances have been made in MINLP solution software. To fully realize the power of MINLP to solve complex business optimization problems, we need to develop knowledge and expertise concerning MINLP modeling and solution...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید