In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...

Scheduling concerns the allocation of limited resources overtime to perform tasks fulfill certain criterion and optimize one or several objective functions. One most popular models in scheduling theory is that flow-shop scheduling. During last 40 years, permutation sequencing problem with makespan minimization has held attraction many researchers. This characterized as Fm/prmu/Cmax notation Gra...

Single-objective to multi-objective/many-objective optimization (SMO) is a new paradigm in the evolutionary transfer (ETO), since there are only “1 + 4” pioneering works on SMOs so far, that is, “1” continuous and firstly performed by Professors L. Feng H.D. Wang, “4” proposed our group for discrete cases. As computational paradigm, theoretical insights into relatively rare now. Therefore, we p...

Lot sizing and scheduling in flow shop has been considered in this paper. Our study includes a multi-level and multi-period capacitated lot sizing and scheduling problem (CLSP) with sequence-dependent setups, setups carry over in flow shop. In manufacturing environments backlogging is unavoidable. If the production capacity is infinite, any demand can be satisfied