Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements

Gu, Haihua; Kononov, Alexander; Memar, Julia; Zinder, Yakov

doi:10.1016/j.jda.2018.11.011

Cited by 8 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…have considered limited buffer in FS problem with minimizing themakespan in two-stage which consisting of discrete processor, a batch processor, and incompatible job families. Gu et al [35], tried to minimize the completion time of the two-stage flow shop scheduling problem with a limited buffer. They presented a Lagrangian relaxation that allows use for each problem which is based on the analysis approach.…”

Section: Buffer Capacity and Scheduling Problemmentioning

confidence: 99%

A Mathematical Model for Lot-streaming Hybrid Flow Shop Scheduling Problem by Considering Learning Effect and Buffer Capacity

Ruhbakhsh¹,

Mehdizadeh²,

Adibi³

2022

Scientia Iranica

View full text Add to dashboard Cite

Lot streaming, is an effective technique to increase efficiency in a production system by splitting a job into several smaller parts to overlap operations between successive machines in a multi-stage production system. In this paper, a hybrid flow shop scheduling problem with lot streaming, learning effect and buffer's limitation is considered. A bi-objective mathematical model is presented for minimizing the total tardiness and the makespan. To validate the proposed model, the bi-objective model converted to single objective model by weighting method and an example is solved using GAMS software.Since the problem is NP-hard,NSGA-II and NRGA are used to solve the large scale of the problems and the first available machine (FAM) rule is used to assign the jobs to the machines from the first stage onwards in solution representation. Also, Taguchi method is used to tune the algorithms parameters. For evaluating the performance of the algorithms, the results obtained from GAMS compared with outputs of the GA algorithms. Also, 30 instance problems are randomly generated and six indicators are used to compare the algorithms together. After performing the experiments and comparingNSGA-II and NRGAalgorithms with each other based on each index, the appropriate algorithm is selected.

show abstract

Section: Buffer Capacity and Scheduling Problemmentioning

confidence: 99%