Although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. This paper deals with scheduling jobs in lot streaming flexible flow line problems. The paper mathematically formulates the problem by a mixed integer linear programming model. This model solves small instances to optimality. Moreo...

This paper presents an effective stochastic algorithm that embeds a large neighborhood decomposition technique into variable search for solving the permutation flow-shop scheduling problem. The first constructs as seed using recursive application of extended two-machine In this method, jobs are recursively decomposed two separate groups, and, each group, optimal is calculated based on Then over...

RMC (Ready-mixed concrete) vehicle scheduling problem is a complex combinatorial optimization problem with intersection of several research areas, such as logistics, just-in-time production and supply chains etc. We integrates RMC production scheduling and vehicle dispatch problems in the same framework by network flow techniques and establishes a mixed integer programming model for ready-mixed...

The no idle permutation flow shop scheduling problem (NIPFSP) is a popular NP-hard combinatorial optimization problem, which exists in several real world production processes. This study proposes a novel hybrid estimation of the distribution algorithm and cuckoo search (CS) algorithm (HEDA_CS) to solve the NIPFSP with the total tardiness criterion minimization. The problem model is built on the...