Seru loading with worker-operation assignment in single period

Luo, Lan; Zhang, Z.; Yin, Yong

doi:10.1109/ieem.2016.7798039

Cited by 12 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Luo vd. [12] tarafından yapılan bir diğer seru yükleme probleminde tamamen bölümlenmiş serulardan oluşan bir üretim sistemi dikkate alınmıştır. Burada her seruya atanmış işgücü belirlidir.…”

Section: Li̇teratür Araştirmasi (Literature Review)unclassified

Seru üretim sistemlerinde yükleme problemi için karışık tamsayılı bir matematiksel model ve mat-sezgisel çözüm yaklaşımı

Çalışkan

İşleyen

Çerçioğlu

2021

Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi

View full text Add to dashboard Cite

A mixed integer mathematical model proposal for Seru loading problem  A matheuristic method proposal for relatively large-scale problems  Comparative analysis and demonstration of effectiveness This study discusses Seru Loading Problem, which is one of the problems encountered in seru production systems. A new mathematical model is proposed to obtain optimal worker and work load to specific seru design. For relatively large problems, we also propose a matheuristic approach, which is based on mathematical model. Tests results show that matheuristic approach is able to generate good-quality solutions. Figure A. Flow of the seru loading problem solution approaches Purpose: The aim of the study is to obtain optimal seru loading plans for seru production system that meets the speed of mass production systems and the product diversity capability of flexible production systems. Theory and Methods: We formulate the Seru Loading Problem as a Mixed Integer Linear Program (MILP), which can be solved by any standard MILP solver. Due to limited performance of the solvers in addressing relatively large instances, we propose a matheuristic approach that effectively presents high quality solutions for seru loading problem. Results: The comparison results illustrated that the results in the literature are improved in the range of 5.6% to 13% by the proposed mathematical model. All best results achieved with the matheuristic method are better than or equal to those achieved with the mathematical model under terminating conditions. There are significant differences in solution times between model and matheuristic. The mathematical model takes 30 and 182 times more than the matheuristic method. The results show that the proposed method is effective in both solution quality and solution time when making business-level decisions in the seru loading problem. Conclusion: To obtain optimal work force and work plans for seru loading problem, a new mathematical model and matheuristic approach are proposed. In future studies these approaches can be used in other seru-related problems such as seru balancing and line-seru conversion.

show abstract

Section: Li̇teratür Araştirmasi (Literature Review)unclassified

Seru üretim sistemlerinde yükleme problemi için karışık tamsayılı bir matematiksel model ve mat-sezgisel çözüm yaklaşımı

Çalışkan

İşleyen

Çerçioğlu

2021

Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi

View full text Add to dashboard Cite

show abstract

“…Yu et al (2015) [57] combined the complexity of seru formation with the complexity of seru loading, and concluded that SPT (shortest processing time) can be used as a typical seru loading rule. Luo et al (2016) [28] studied the seru loading problem considering worker-operation assignment, used a mathematical model to describe the problem, and designed a heuristic algorithm to solve the model. Luo et al (2017) [29] studied the seru loading problem with the goal of minimizing the makespan and the total delay penalty cost under uncertainty.…”

Section: Introductionmentioning

confidence: 99%

A two-phase branch-and-bound algorithm for seru scheduling problems with sequence-dependent setup time

Zhang

Gong

et al. 2022

Preprint

View full text Add to dashboard Cite

This paper focuses on seru scheduling problems considering the sequence-dependent setup time in seru production system (SPS), which is a new-type manufacturing system originated in Japanese production practice recently that can better adapt to the fluctuate market demand. A mixed integer programming (MIP) model with the objective of minimizing the sum of the makespan and the weighted tardiness is constructed for the seru scheduling problem. The two-phase B&B (TPBB) algorithm is designed subsequently, where the first phase solves the assignment of products to serus , while the second phase solves the scheduling optimization in each seru . Finally, the computational experiments and comparative analysis with CPLEX 12.8 are made, and the report of results verifies that the effectiveness and practicability of the proposed MIP model and TPBB algorithm.

show abstract

An exact branch-and-bound algorithm for seru scheduling problems with sequence-dependent setup time

Zhang

Gong

et al. 2023

Soft Comput

View full text Add to dashboard Cite

Seru loading with worker-operation assignment in single period

Cited by 12 publications

References 6 publications

Seru üretim sistemlerinde yükleme problemi için karışık tamsayılı bir matematiksel model ve mat-sezgisel çözüm yaklaşımı

Seru üretim sistemlerinde yükleme problemi için karışık tamsayılı bir matematiksel model ve mat-sezgisel çözüm yaklaşımı

A two-phase branch-and-bound algorithm for seru scheduling problems with sequence-dependent setup time

An exact branch-and-bound algorithm for seru scheduling problems with sequence-dependent setup time

Contact Info

Product

Resources

About