This paper constructs a model with a dependent setting where the time between two claim occurrences determines the distribution of the next claim size. We derive the exact expression of the survival probability for the exponentially distributed claim sizes. For the generally distributed claim...

The lot-streaming flow shop scheduling problem plays an important role in modern industry. This paper addresses this problem with the objective of minimizing the total weighted earliness and tardiness penalties and then proposes a simple but effective iterated local search (ILS) algorithm. In...

Minimax problems can be approached by reformulating them into smooth problems with constraints or by dealing with the non-smooth objective directly. We focus on verified enclosures of all globally optimal points of such problems. In smooth problems in branch and bound algorithms, interval Newton...

Process planning and scheduling are two of the most important functions in the manufacturing system. Traditionally, process planning and scheduling were regarded as separate tasks performed sequentially, where scheduling was implemented after process plans had been generated. However, their...

Local sensitivity for certain density bounded class of priors are considered. We give an exact form of the local sensitivity of the posterior mean and the posterior median, and also investigate the behavior of these local sensitivity measures for varying values of data in a specific example.

In a standard two-sector neoclassical model with distortions, capital mobility can render the steady state indeterminate, in the sense that there exist infinitely many convergent paths. In the closed economy with no international capital mobility, the utility function must be linear or close to...

The purpose of this paper is to characterize the possibility of indeterminacy in multisector growth models that exhibit constant marginal returns to scale at the social level, with empirically realistic small external effects. Our results demonstrate that indeterminacy does not require...

The continuous network design problem (CNDP) is characterized by a bilevel programming model and recognized to be one of the most difficult and challenging problems in transportation. The main difficulty stems from the fact that the bilevel formulation for the CNDP is nonconvex and...