Flexible job shops are characterized by the existence of alternative –not necessarily identicalmachines, which permits parts to have different alternative routes in the shop. In a dynamic scheduling situation in which jobs continuously arrive over time, part routing rules are needed to deal with such routing flexibility as much as sequencing rules which define the order by which parts are admit...

This paper provides an application oriented analysis of local search procedures for Operation Scheduling and Shop Floor Management of a major German manufacturer of cigarette machines. The heuristics applied are the Thresholdand Simulated Annealing-Algorithm considering Job Shop as well as embedded FMS production features. In this context a new neighbourhood search technique is developed, which...

In the paper we discuss the influence of the route flexibility degree, the open rate of operations and the production type coefficient on makespan. The flexible job-open shop scheduling problem FJOSP (an extension of the classical job shop scheduling) is analyzed. For the analysis of the production process we used a hybrid heuristic of the GRASP (greedy randomized adaptive search procedure) wit...

When faced with a multiobjective optimization problem, it is necessary to consider the decision-maker preferences in order propose best compromise solution. We flexible job shop scheduling problem and that represented using non-compensatory reference level-based preference model. show how integrating this model into genetic algorithm allows obtain solutions surpass more aspiration levels when c...

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...

To improve the management of collaborative manufacturing tasks in MES and promote digital transformation discrete enterprises, based on has been studied. First, business flow an was analyzed systematically. Second, algorithm detailed scheduling for studied, a model external resources designed. Then, solution presented hybrid genetic algorithm. Finally, execution process promoted integration ERP...

— Flexible Job Shop scheduling problem (FJSSP) is an important scheduling problem which has received considerable importance in the manufacturing domain. In this paper a genetic algorithm (GA) based scheduler is presented for flexible job shop problem to minimise makespan. The proposed approach implements a domain independent GA to solve this important class of problem. The scheduler is impleme...