Lot sizing and scheduling in flow shop has been considered in this paper. Our study includes a multi-level and multi-period capacitated lot sizing and scheduling problem (CLSP) with sequence-dependent setups, setups carry over in flow shop. In manufacturing environments backlogging is unavoidable. If the production capacity is infinite, any demand can be satisfied

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

Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. A Variable Neighborhood Genetic Algorithm (VNGA) is proposed for the problem with makespan criterion, consisting of a combination of the variable neighborhood search (VNS) and genetic algorithm (GA). Variable ne...

Scheduling is a scientific domain concerning the allocation of limited tasks over time. The goal of scheduling is to maximize (or minimize) different criteria of a facility as makespan, occupation rate of a machine, total tardiness ... In this area, scientific community usually group the problem with, on one hand the system studied, defining the number of machines (one machine, parallel machine...

This paper presents a fuzzy approach to capacitated flow shop scheduling problem. Fuzzy sets are applied to express the flexible constraints on capacity of each period in the scheduling horizon. Fuzzy sets are also used to model the processing times of jobs and the setup times of machines required when a new job starts processing. Demand is set for each period. Over production incurs the holdin...

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

In this paper we present the integration of an ant-based algorithm with a greedy algorithm for solving the scheduling of a multi-stage plant. A multi-stage manufacturing plant is comprised of different stages: mixing, storage, packing and finished goods storage, and is an extension of the classic Flow Shop Scheduling Problem (FSP). The algorithmic details for the Multi Stage Flow Shop Schedulin...

This paper deals with scheduling problems of the Flexible manufacturing systems (FMS). The objective is to improve the utilization of FMS. Lot Streaming (LS) is used to meet this objective. In this paper a comparative study is performed between the applications of new methods: Brute Force method (BFM) and Joinable Schedule Approach (JSA). Case studies for Flow Shop Systems (FSS) are performed. ...

Flexible manufacturing systems (FMSs) are nowadays installed in the mechanical industry. In such systems. many different part types are produced simultaneously and it is necessary to take tooling constraints into account for finding an optimal schedule. A heuristic method is presented for solving the m-machine, n-job shop scheduling problem with tooling constraints. This method. named TOMATO, i...