The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a finite subset of candidate machines. The aim is to find an allocation for each operation and to define the sequence of operations on each machine so that the resulting schedule has a minimal completion time. We propose ...

Scheduling is a combinatorial problem with important impact on both industry and commerce. If it is performed well it yields time and efficiency benefits and hence reduces costs. Genetic Algorithms have been applied to solve several types of scheduling problems; Flow Shop, Resource, Staff and Line Balancing have all been tackled. However Jobshop Scheduling is the most common problem of interest...

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

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

Purpose To investigate the efficiency of a discretization procedure utilizing a time-indexed mathematical optimization model for finding accurate solutions to flexible job shop scheduling problems considering objectives comprising makespan and tardiness, respectively. Design/methodology/approach A time-indexed mixed integer programming model is used to find solutions by iteratively employing ti...

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 this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

in this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. the main idea is that the processing times of operations may be controlled by consumptions of additional resources. the purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. the proposed model, flexibl...

Flexible job-shop scheduling problem (FJSP) in the field of production scheduling presents a quite difficult combinatorial optimization problem. Machines are mostly considered to be the only resource in many research projects dealing with FJSP. In actual production, there are many other factors which influence production scheduling, such as transportation, storage and detection. If machines are...