We address the single-machine stochastic scheduling problem with an objective of minimizing total expected earliness and tardiness costs, assuming that processing times follow normal distributions and due dates are decisions. We develop a branch and bound algorithm to find optimal solutions to...

A column generation based approach is proposed for solving the cluster-wise regression problem. The proposed strategy relies firstly on several efficient heuristic strategies to insert columns into the restricted master problem. If these heuristics fail to identify an improving column, an...

The mixed-model sequencing problem is to sequence different product models launched down an assembly line, so that work overload at the stations induced by direct succession of multiple labour-intensive models is avoided. As a concept of clearing overload situations, especially applied by...

Using the ARFIMA-FIGARCH model, this paper studies the efficiency of the Japanese equity market by examining the statistical properties of the return and volatility of the Nikkei 225. It shows that both follow a long range dependence, which stands against the efficient market hypothesis (EMH)....

In this paper, we propose an optimal algorithm for the Multiple-choice Multidimensional Knapsack Problem MMKP. The main principle of the approach is twofold : (i) to generate an initial solution, and (ii) at different levels of the tree search to determine a new upper bound used with a...

This paper deals with the scheduling of a two-machine flowshop with an availability constraint on the first machine with the aim of minimizing the makespan. We investigate two mixed-integer programming (MIP) models for this problem. Then we propose a branch and bound (B&B) algorithm based on a...

The method investigated in this paper is concerned with the multivariate global optimization with box constraints. A new quadratic lower bound in a branch and bound framework is proposed. For a continuous, twice differentiable function f, the new lower bound is given by a difference of the...

This paper addresses the problem of minimizing the total tardiness of a set of jobs to be scheduled on identical parallel machines where jobs can only be delivered at certain fixed delivery dates. Scheduling problems with fixed delivery dates are frequent in industry, for example when a...

This article presents a practicable algorithm for globally solving sum of linear ratios problem (SLR). The algorithm works by globally solving a bilinear programming problem (EQ) that is equivalent to the problem (SLR). In the algorithm, by utilizing convex envelope and concave envelope of...