This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...

Depth-first proof-number (df-pn) search is a powerful member of the family of algorithms based on proof and disproof numbers. While df-pn has succeeded in practice, its theoretical properties remain poorly understood. This paper resolves the question of completeness of df-pn: its ability to solve any finite boolean-valued game tree search problem in principle, given unlimited amounts of time an...

Sustainability issues involve complex interactions between social, economic, and environmental factors that are often viewed quite differently by disparate stakeholder groups. Issues of non-sustainability are wicked problems that have many, often obscure causes, and for which there is no single, straightforward solution. Furthermore, the concept of sustainability is itself contested. For exampl...

Hierarchical multimodal hub location problem is a cost-minimizing hub covering problem where two types of hubs and hub links, accounting for ground and air transportation, are to be established, while ensuring time-definite deliveries. We propose a mixed-integer programming formulation and perform a comprehensive sensitivity analysis on the Turkish network. We show that the locations of airport...

A semi-definite programming (SDP) formulation of the multi-objective economic-emission dispatch problem is presented. The fuel cost and emission functions are represented by high order polynomial functions and this was shown to be a more accurate representation of the economic-emission dispatch (EED) problem. Furthermore, the polynomial functions of both objective functions are aggregated into ...

In this manuscript we will present a new fast technique for solving the generalized eigenvalue problem T x = λSx, in which both matrices T and S are symmetric tridiagonal matrices and the matrix S is assumed to be positive definite.1 A method for computing the eigenvalues is translating it to a standard eigenvalue problem of the following form: L−1T L−T (LT x) = λ(LT x), where S = LLT is the Ch...