We study the improvement of non-permutation over permutation schedules in flow shops when minimizing the total completion time. We solve both problems by a two-phase heuristic. The first phase uses an iterated local search to find a good permutation schedule. The second phase explores non-permutation schedules using an effective insertion neighborhood, that permits to anticipate or delay a job ...

The performance of a scheduling system, in practice, is not evaluated to satisfy a single objective, but to obtain a trade-off schedule regarding multiple objectives. Therefore, in this research, we make use of one of the multiple objective decision-making methods, a global criterion approach, to develop a multi-objective model for solving FMS scheduling problems with consideration of three per...

BACKGROUND The private retail drug shops market in Bangladesh is largely unregulated and unaccountable, giving rise to irrational use of drugs and high Out-of-pocket expenditure on health. These shops are served by salespersons with meagre or no formal training in dispensing. METHOD This facility-based cross-sectional study was undertaken to investigate how the drug shops currently operate vi...

in this study a machine learning algorithm was applied in order to develop a predictive model for the changes in phytoplankton biomass (chlorophyll a) in the lower nakdong river, south korea. we used a “hybrid evolutionary algorithm (hea)” which generated model consists of three functions ‘if-thenelse’ on the basis of a 15-year, weekly monitored ecological database. we used the average ...

The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedure where a series of One Machine Sequencing Problems (OMSPs) are solved. However, such a procedure has been reported to be highly ineffective for the Flow Shop problems (Jain and Meeran 2002). In particular, we show th...

In this paper the resource-constrained flow shop (RCF) problem is addressed. A number of realistic extensions are incorporated, including non-serial precedence requirements, mixed flow shop situations, and the distribution of the human workforce among a number of pre-determined groups. The RCF is then solved by meta-heuristics, primarily of the evolutionary type. An extensive numerical investig...