Minimising total tardiness for the identical parallel machine scheduling problem with splitting jobs and sequence-dependent setup times

Kim, Jae-Gon; Song, Seokwoo; Jeong, BongJoo

doi:10.1080/00207543.2019.1672900

Cited by 34 publications

(14 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A study conducted in another textile company has four production patterns that produce pants that targeted the best fit for customers and developed an optimum pattern. The key finding of the study is that there is a need for further studies on optimum body shapes and sizes to produce effectively and more focus on the development of trouser-making patterns (Kim et al, 2020). Another study aims to create an optimal parallel machine schedule that minimizes the total delay and they used constraints such as the total amount of sub-tasks of a task processed on different machines being equal to the size of the task, the number of sub-tasks of a task on a machine is equal to zero if the task is not processed on the machine, and ensuring a task is properly linked to a machine (Lim and Cassidy, 2017).…”

Section: Literature Surveymentioning

confidence: 99%

Bi̇r Teksti̇l Şi̇rketi̇ İçi̇n Üreti̇m Hatti Atama Problemi̇

ABDELSALAM>¹,

MOHAMMOUD>²,

EDER>³

et al. 2023

Mühendislik Bilimleri Ve Tasarım Dergisi

View full text Add to dashboard Cite

In this study, the production process of Karaman Textiles, for which production planning is done manually, was observed and analyzed. This study aims to minimize the unused machine capacity and idle time of the existing system by developing a mixed integer programming (MIP) model, developing scenarios, and obtaining the results with GAMS software. In addition, the results of the scenarios are compared and evaluated to reach the optimal result that meets and maximizes the efficiency of the production process. The company's usual production planning is done manually and determined according to annual demand. The study aims to minimize the machine working times and that complete planning of the production in the most optimal way. In this study, the company's production time and machine usage times were optimized, and under normal conditions, 15,000 fabric pants were produced for 8 hours a day, 5 days a week, and 4 weeks a month. The scenario analysis aimed to produce by adding 4,000 pieces of velvet pants in addition to 15,000 fabric pants in the first scenario. The second scenario aims to minimize the production time of 15,000 fabric pants by limiting the working times of the machines owned by the company.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Bi̇r Teksti̇l Şi̇rketi̇ İçi̇n Üreti̇m Hatti Atama Problemi̇

ABDELSALAM>¹,

MOHAMMOUD>²,

EDER>³

et al. 2023

Mühendislik Bilimleri Ve Tasarım Dergisi

View full text Add to dashboard Cite

show abstract

“…Ref. [5] presented a mathematical model for an identical parallel machine scheduling problem in which job splitting and sequence-dependent setup times were considered. Simulated annealing and genetic algorithm metaheuristic-based approaches were proposed with various encoding and decoding methods.…”

Section: Identical Parallel Machinesmentioning

confidence: 99%

A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem

Lin

Huang

2021

Mathematics

View full text Add to dashboard Cite

The unrelated parallel machine scheduling problem aims to assign jobs to independent machines with sequence-dependent setup times so that the makespan is minimized. When many practical considerations are introduced, solving the resulting problem is challenging, especially when problems of realistic sizes are of interest. In this study, in addition to the conventional objective of minimizing the makespan, we further consider the burn-in (B/I) procedure that is required in practice; we need to ensure that the scheduling results satisfy the B/I ratio constrained by the equipment. To solve the resulting complicated problem, we propose a population-based simulated annealing algorithm embedded with a variable neighborhood descent technique. Empirical results show that the proposed solution strategy outperforms a commonly used commercial optimization package; it can obtain schedules that are better than the schedules used in practice, and it does so in a more efficient manner.

show abstract

“…A new mathematical model with metaheuristic approaches was proposed to solve the problem. The results indicate that the suggested algorithm provides better solution quality and less computational time compare to optimization solvers [22].…”

mentioning

confidence: 93%

Bi-objective unrelated parallel machines scheduling problem with worker allocation and sequence dependent setup times considering machine eligibility and precedence constraints

Foroutan

Rezaeian

Shafipour

2023

JIMO

View full text Add to dashboard Cite

<p style='text-indent:20px;'>In today's competitive world, scheduling problems are one of the most important and vital issues. In this study, a bi-objective unrelated parallel machine scheduling problem with worker allocation, sequence dependent setup times, precedence constraints, and machine eligibility is presented. The objective functions are to minimize the costs of tardiness and hiring workers. In order to formulate the proposed problem, a mixed-integer quadratic programming model is presented. A strategy called repair is also proposed to implement the precedence constraints. Because the problem is NP-hard, two metaheuristic algorithms, a multi-objective tabu search (MOTS) and a multi-objective simulated annealing (MOSA), are presented to tackle the problem. Furthermore, a hybrid metaheuristic algorithm is also developed. Finally, computational experiments are carried out to evaluate different test problems, and analysis of variance is done to compare the performance of the proposed algorithms. The results show that MOTS is doing better in terms of objective values and mean ideal distance (MID) metric, while the proposed hybrid algorithm outperforms in most cases, considering other employed comparison metrics.</p>

show abstract

Minimising total tardiness for the identical parallel machine scheduling problem with splitting jobs and sequence-dependent setup times

Cited by 34 publications

References 34 publications

Bi̇r Teksti̇l Şi̇rketi̇ İçi̇n Üreti̇m Hatti Atama Problemi̇

Bi̇r Teksti̇l Şi̇rketi̇ İçi̇n Üreti̇m Hatti Atama Problemi̇

A Hybrid Metaheuristic for the Unrelated Parallel Machine Scheduling Problem

Bi-objective unrelated parallel machines scheduling problem with worker allocation and sequence dependent setup times considering machine eligibility and precedence constraints

Contact Info

Product

Resources

About