scholarly journals Exact and heuristic procedures for the Heijunka-flow shop scheduling problem with minimum makespan and job replicas

2021 ◽  
Author(s):  
Joaquín Bautista-Valhondo
Keyword(s):  
Mixed Integer Linear Programming ◽  
Assembly Line ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Mixed Integer ◽  
Manufacturing Plant ◽  
Shop Scheduling ◽  
Satisfactory Performance

AbstractIn this paper, a new problem of job sequences in a workshop is presented, taking into account non-unit demands for the jobs and whose objective is to minimize the total completion time for all the jobs ($${C}_{max}$$ C max ) satisfying a set of restrictions imposed on the problem to preserve the production mix. Two procedures are proposed to solve the new problem: Mixed Integer Linear Programming and a Metaheuristic based on Multistart and Local Search. The two proposed procedures are tested using instance set Nissan-9Eng.I, in both cases giving rise to highly satisfactory performance both in quality of solutions obtained and in the CPU times required. Through a case study of the Nissan engine manufacturing plant in Barcelona, our economic-productive analysis reveals that it is possible to save an average of € 1162.83 per day, manufacturing 270 engines, when we transform the current assembly line into a Heijunka-Flow Shop.

scholarly journals Integration of Lot Sizing and Flow Shop Scheduling with Lot Streaming

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
Navid Mortezaei ◽  
Norzima Zulkifli
Keyword(s):  
Flow Shop ◽  
Lot Sizing ◽  
Flow Shop Scheduling ◽  
Mixed Integer ◽  
Lot Streaming ◽  
Optimal Sequence ◽  
Shop Scheduling ◽  
Proposed Model ◽  
Integer Linear Model ◽  
No Wait

We will develop a mathematical model for the integration of lot sizing and flow shop scheduling with lot streaming. We will develop a mixed-integer linear model for multiple products lot sizing and lot streaming problems. Mixed-integer programming formulation is presented which will enable the user to find optimal production quantities, optimal inventory levels, optimal sublot sizes, and optimal sequence simultaneously. We will use numerical example to show practicality of the proposed model. We test eight different lot streaming problems: (1) consistent sublots with intermingling, (2) consistent sublots and no intermingling between sublots of the products (without intermingling), (3) equal sublots with intermingling, (4) equal sublots without intermingling, (5) no-wait consistent sublots with intermingling, (6) no-wait equal sublots with intermingling, (7) no-wait consistent sublots without intermingling, and (8) no-wait equal sublots without intermingling. We showed that the best makespan can be achieved through the consistent sublots with intermingling case.

Parallel Machine Shop Scheduling Using Memetic Algorithm

2014 ◽  
Vol 573 ◽  
pp. 362-367
Author(s):  
Senthil Vairam ◽  
V. Selladurai
Keyword(s):  
Flow Shop ◽  
Memetic Algorithm ◽  
Parallel Machine ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Task Graph ◽  
Machine Shop ◽  
Shop Scheduling ◽  
Hybrid Flow Shop Scheduling

Parallel machine shop scheduling problem can be stated as finding a schedule for a general task graph to execute on a customed flow so that the schedule length can be minimized. Parallel Flow Shop Scheduling with a case study has been . In this study we present an effective memetic algorithm to solve the problem. Also evaluating the performance of two algorithms (genetic algorithm and memetic algorithm) in terms of both the quality of the solutions produced and the efficiency. These results demonstrate that the memetic algorithm produces better and quality solutions and hence it is very efficient . KEY WORDS: Hybrid Flow Shop Scheduling, Multiprocessor, Memetic algorithm.

scholarly journals Two-machine flow shop with synchronized periodic maintenance

2019 ◽  
Vol 53 (1) ◽  
pp. 351-365 ◽  
Author(s):  
Issam Krimi ◽  
Rachid Benmansour ◽  
Saïd Hanafi ◽  
Nizar Elhachemi
Keyword(s):  
Variable Neighborhood Search ◽  
Flow Shop ◽  
Programming Model ◽  
Flow Shop Scheduling ◽  
Mixed Integer ◽  
Neighborhood Search ◽  
Shop Scheduling ◽  
Availability Constraints ◽  
Periodic Maintenance ◽  
One Machine

In the literature, some works deal with the two-machine flow shop scheduling problem under availability constraints. Most of them consider those constraints only for one machine at a time and also with limited unavailability periods. In this work, we were interested by the unlimited periodic and synchronized maintenance applied on both machines. The problem is NP-hard. We proposed a mixed integer programming model and a variable neighborhood search for solving large instances in order to minimize the makespan. Computational experiments show the efficiency of the proposed methods.

An evolutionary algorithm recommendation method with a case study in flow shop scheduling

2020 ◽  
Vol 109 (3-4) ◽  
pp. 781-796
Author(s):  
Ying Zuo ◽  
Yuqi Wang ◽  
Yuanjun Laili ◽  
T. Warren Liao ◽  
Fei Tao
Keyword(s):  
Evolutionary Algorithm ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document