Drum-Buffer-Rope-based production planning and control (PPC) approaches provide production managers with effective tools to manage production disruptions and improve operational performance. The corner stone of these approaches is the proper selection of time-buffers which are considered as exogenously defined constant. However, the majority of real-world manufacturing systems are characterized...

This paper describes a genetic algorithm approach to the dynamic job shop scheduling problem with jobs arriving continually. Both deterministic and stochastic models of the dynamic problem were investigated. The objective functions examined were weighted flow time, maximum tardiness, weighted tardiness, weighted lateness, weighted number of tardy jobs, and weighted earliness plus weighted tardi...

The major theme of this thesis is the mathematical optimization modelling of the flexible job shop scheduling problem. This problem is present in the so-called multitask cell—a production cell at GKN Aerospace’s facility located in Trollhättan, Sweden—which has served as a case study during the work with this thesis. The thesis consists of two parts, of which the first considers the major theme...

This paper considers our work in progress on the problem of scheduling production activities in a real-life manufacturing plant. The problem is modelled as a two-stage flexible flow shop problem with minimization of the makespan and the number of tardy jobs. The design approach of an evolutionary algorithm is described. Preliminary experiments are performed and results obtained show the improve...

The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A proportionate flexible flow shop (PFFS) is a machine environment with parallel identical machines at each stage. This study presents an effective hybrid approach based on constructive genetic algorithm (CGA) for PFFS sch...

The flexible job shop scheduling problem (FJSP) is one of the most difficult NP-hard combinatorial optimization problems. It is extremely difficult to solve the FJSP with the disturbances of manufacturing environment, which is always regarded as the flexible job shop online scheduling problem. This paper proposes a new method based on Process-Tree to solve this type of scheduling problem. Proce...

Flexible job-shop scheduling problem (FJSSP) is an extension of the classical job-shop scheduling problem that allows an operation to be processed by any machine from a given set along different routes. It is very important in both fields of production management and combinatorial optimisation. This paper presents a new approach based on attribute oriented mining technique to solve the multi-ob...