One of the most widely studied problems in flow shop scheduling is not allowing jobs to wait
to be processed at the next stage. This constraint causes the job to be processed …

Metaheuristic algorithms are computational intelligence paradigms especially used for
solving different optimization issues. Metaheuristics examine a collection of solutions …

A Mobile Ad-hoc Network (MANET) refers to a dynamic and wireless network, which can be
designed without an existing infrastructure as every node serves as a router. A MANET is a …

Scheduling in foundry consist a type of production where, the hot work-in-processes cannot
wait between two successive operations and can be modeled as a flow shop scheduling …

Implementation of optimization algorithm for test case generation in Model-Based Testing
(MBT) for Software Product Line (SPL) has been increasing, due to the demand for optimal …

The world health organization (WHO) proclaimed the COVID-19, commonly known as the
coronavirus disease 2019, was a pandemic in March 2020. When people are in close …

The optimal sizing of analog circuits is one of the most complicated processes, because of
the number of variables taken into, to the number of required objectives to be optimized and …

The no-wait flow shop is a flowshop in which the scheduling of jobs is continuous and
simultaneous through all machines without waiting for any consecutive machines. The …

In optimization, scheduling problem is concerning allocations of some resources which are
usually limited. These allocations are done in order to fulfil some criterion by performing …

This paper presents a cloud theory-based iterated greedy (CTIG) algorithm for solving the no-
wait flowshop scheduling problem (NWFSP) with the objective of minimizing the sum of …