This paper deals with the non-permutation flowshop problem which means that the job sequences are allowed to be different on machines. The objective function is minimizing the total tardiness. Firstly, three mixed-integer linear programming (MILP) models for non-permutation flowshop problems are described, and then are analyzed and assessed their relative effectiveness. Secondly, two Tabu searc...

The paper describes an algorithm for solving the scheduling problem of a hybrid flowshop (flowshop with multiple processors, FSMP). The algorithm is a combination of genetic algorithm and tabu search, and the batch processes it is applied on are modeled by a model of time requirements. The paper describes the algorithm and compares its performance with other optimization techniques.

This research presents a novel approach to solve m-machine no-wait flowshop scheduling problem. A continuous flowshop problem with total flowtime as criterion is considered applying a hybrid evolutionary algorithm. The performance of the proposed method is evaluated and the results are compared with the best known in the literature. Experimental tests show the superiority of the evolutionary hy...

In the competitive market of B2B E-commerce platform, the former entrant has the advantage of switching cost while the later entrant has the advantage of declining IT cost. Considering the variable investment cost due to the improvement of platform quality, the paper develops an IT investment model to investigate the best investment strategy for B2B E-commerce platform under the impact of switc...

In this study of the impact of protests against Walmart (a first entrant) on Target (a second entrant) from 1998 to 2008 in U.S. geographic markets, we develop and test a theory of information spillovers from protests against corporations proposing to enter a new market. We argue that the number of protests directed against a first entrant is a noisy signal for the second entrant because such p...

This paper presents an improved artificial bee colony (IABC) algorithm for solving the blocking flowshop problem with the objective of minimizing makespan. The proposed IABC algorithm utilizes discrete job permutations to represent solutions and applies insert and swap operators to generate new solutions for the employed and onlooker bees. The differential evolution algorithm is employed to obt...

In this paper we study the classical no-wait flowshop scheduling problem with makespan objective (F |no−wait|Cmax in the standard three-field notation). This problem is well-known to be a special case of the asymmetric traveling salesman problem (ATSP) and as such has an approximation algorithm with logarithmic performance guarantee. In this work we show a reverse connection, we show that any p...

The basic partial differential equation PDE models for supply chain networks with re-entrant nodes and their macroscopic are proposed. However, through numerical examples, the basic continuummodels do not performwell for multiple re-entrant systems. Then, a new state equation considering the re-entrant degree of the products is introduced to improve the effectiveness of the basic continuum mode...