This article studies a container drayage problem with flexible orders defined by using requiring and releasing attributes as a unified formulation of various order types. A determined-activities-on-vertex (DAOV) graph introduces a temporary vertex set to formulate different truck statuses. The...

The advancement of Internet technology has enabled new formats for selling products in the B2C online auctions. At present, on the major online auction sites, there exist three popular selling formats, namely, the posted price, pure auction and buy-price auction formats. It is an important...

In this paper, the authors propose a conceptual model that aims to increase the competitiveness of a company though a systems engineering approach. This process which the company adopted to enhance its manufacturing system in a step-by-step manner is elaborated. Central to the strategy is the...

Virtual enterprises (VEs) are essential components of global manufacturing. Minimizing risk is the key problems to overcome in order to ensure the success of a VE. The operation of VE is always organized by project mode and there are many uncertain factors that are fuzzy in VE. This paper...

This paper proposes the adoption of an integrated inventory and transportation system (IITS) to minimize the total costs of inventory and transportation. A non-linear programing is developed by analyzing transportation and inventory costs with one supplier and many retailers in the distribution...

The minimum weighted dominating set (MWDS) problem is one of the classic NP-hard optimization problems in graph theory with applications in many fields such as wireless communication networks. MWDS in general graphs has been showed not to have polynomial-time constant-approximation if <InlineEquation ID="IEq1"> <EquationSource...</equationsource></inlineequation>

In the Minimum k-Path Connected Vertex Cover Problem (MkPCVCP), we are given a connected graph G and an integer k ≥ 2, and are required to find a subset C of vertices with minimum cardinality such that each path with length k − 1 has a vertex in C, and moreover, the induced subgraph G[C]...