This paper considers the solution of Mixed Integer Nonlinear Programming (MINLP) problems. Classical methods for the solution of MINLP problems decompose the problem by separating the nonlinear part from the integer part. This approach is largely due to the existence of packaged software for solving Nonlinear Programming (NLP) and Mixed Integer Linear Programming problems. In contrast, an integ...

For irregular architectures global register allocation remains a challenging problem, and has received a lot of attention in recent years. The classical graph-colouring analogy used by Chaitin and Briggs is not adequate for irregular architectures featuring non-orthogonal instruction sets and irregular register sets. Previous work [1, 2] on register allocation based on partitioned boolean quadr...

We address the 3-Machine Assembly-Type Flowshop Scheduling Problem (3MAF). This problem is known to be NP-complete in the strong sense. We propose an exact branch and bound method based on a recursive enumeration of potential inputs and outputs of the machines. Using this algorithm, several large size instances have been solved to optimality.

in this paper, we considered solving approaches to flexible job shop problems. makespan is not a good evaluation criterion with overlapping in operations assumption. accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. as overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

A stochastic version of a concentrator location problem is dealt with in which traffic demand at each terminal location is uncertain. The concentrator location problem is defined as to determine the following: (i) the numbers and locations of concentators that are to be open, and (ii) the allocation of terminals to concentrator sites. The problem is formulated as a stochastic multi-stage intege...

The fleet assignment problem is an integral part of the airline planning process. Given a schedule of international flights and certain maintenance criteria required by the Federal Aviation Administration (FAA), the objective of the long haul fleet assignment problem is to assign aircraft of different fleet types to different flights such that operating costs are minimized. We develop a new for...

nowadays, scheduling problems have a considerable application in production and service systems. in this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. in many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinat...

In the field of transportation planning, Network Design Problem (NDP) is a complex and challenging research area which aims to optimize a transportation network in order to maximize traffic and social benefits through capacity expansion and link addition. Recently, ‘equity’ has become highly valued in the decision process of NDP. The objective of this study is to propose novel approaches to int...

This paper presents a fuzzy goal programming (FGP) methodology for solving bi-level quadratic programming (BLQP) problems. In the FGP model formulation, firstly the objectives are transformed into fuzzy goals (membership functions) by means of assigning an aspiration level to each of them, and suitable membership function is defined for each objectives, and also the membership functions for vec...

In this paper, a single-source capacitated multifacility location problem with rectilinear distance under unbalanced transportation constraints is studied. The problem is formulated as a mixed integer linear programming problem of which the objective function is the sum of nonlinear functions. An algorithm under decomposition approach combining with logic based techniques is developed. Using th...