For the no-wait flowshop scheduling problem with maximum lateness criterion, properties are developed to speed up three kinds of basic operations generating candidate solutions, i.e., the insertion of a new job into a partial sequence, and the insertion and exchange neighborhood moves. The...

In this paper, a HGA (hybrid genetic algorithm) is proposed for permutation flowshop scheduling problems (PFSP) with total flowtime minimization, which are known to be NP-hard. One of the chromosomes in the initial population is constructed by a suitable heuristic and the others are yielded...

In this paper, permutation flow shops with total flowtime minimization are considered. General flowtime computing (GFC) is presented to accelerate flowtime computation. A newly generated schedule is divided into an unchanged subsequence and a changed part. GFC computes total flowtime of a...

Purpose: In the ongoing Industry 4.0 era, the internet of things (IoT) has become a global race in the current information technology climate. However, little is understood about the pattern of the global competitive arena or its players’ set up strategy. This paper aims to attempt to compare...

Purpose: The purpose of this paper is to solve the optimal dynamic portfolio problem under the double-exponential jump diffusion (DEJD) distribution, which can allow the asset returns to jump asymmetrically. Design/methodology/approach: The authors solve the problem by solving the HJB equation....

Purpose The purpose of this paper is to present a scan matching simultaneous localization and mapping (SLAM) algorithm based on particle filter to generate the grid map online. It mainly focuses on reducing the memory consumption and alleviating the loop closure problem....