this study considers scheduling in hybrid flow shop environment with unrelated parallel machines for minimizing mean of job's tardiness and mean of job's completion times. this problem does not study in the literature, so far. flexible flow shop environment is applicable in various industries such as wire and spring manufacturing, electronic industries and production lines. after mode...

In this paper, we consider an environment with m machines (or servers) in parallel that operate at different speeds. The processing requirements of all the jobs (or customers) are independent and identically distributed according to the exponential distribution with mean 1. Job j may only be processed on a specific subset of the m machines, which is referred to as its restricted set. We assume ...

An NP-hard problem like Flexible Job Shop Scheduling (FJSP) tends to be more complex and requires computational effort optimize the objectives with contradictory measures. This paper aims address FJSP combined objectives, minimization of make-span, maximum workload, total workload. proposes ‘Hybrid Adaptive Firefly Algorithm’ (HAdFA), a new enhanced version classic Algorithm (FA) embedded adapt...

The multi-objective flexible job shop scheduling in a cellular manufacturing environment is challenging real-world problem. This recently introduced problem variant considers exceptional parts, intercellular moves, transportation times, sequence-dependent family setup and recirculation requiring minimization of makespan total tardiness, simultaneously. A previous study shows that the exact solv...