Batch Scheduling for Hybrid Assembly Differentiation Flow Shop to Minimize Total Actual Flow Time

Maulidya, Rahmi; Suprayogi, Suprayogi; Wangsaputra, Rachmawati; Halim, Abdul Hakim

doi:10.1088/1757-899x/319/1/012042

Cited by 7 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the scheduling sub-problem, batch sequences are developed through semienumeration using the pairwise interchange method. While the solution in Halim and Ohta [32] does not guarantee to produce an optimal solution, it [32] has inspired and been developed for other flow shop problems, including in [33] and [34]. Suryadhini et al [33] discussed batch scheduling problems assuming two product types in a two-stage flow shop, while Maulidya et al [34] developed a two-stage flow shop model with continuous batch sizes [35]- [37].…”

Section: Introductionmentioning

confidence: 99%

Two-Machine Flow Shop Batch Scheduling Model to Minimize Total Actual Flow Time

Yusriski,

Nasution,

Lukas

et al. 2023

Jurnal Teknik Industri

View full text Add to dashboard Cite

This study introduces a scheduling model for a two-machine flow shop batch system to minimize the actual flow time. In this system, two machines are responsible for processing raw materials and producing finished products, with a single bottleneck machine. The entity overseeing the manufacturing process organizes demand units into batches, ensures the accurate and timely arrival of raw materials, and delivers all finished products punctually to meet an expected due date. The study addresses crucial challenges, including determining the optimal number of batches, sizes, and sequences to achieve the specified objective. The analysis adopted an algorithm grounded in the Lagrange relaxation method to tackle these challenges. Moreover, the algorithm is operated by identifying the bottleneck machine as a scheduling reference and determining the appropriate number of batches and sizes. The analysis showed the efficacy of the developed algorithm by using Johnson's rule for making batch sequence decisions through numerical experiments conducted across 1000 cases. The results showed a 1.44% to 4.43% improvement in efficiency compared to previous research, accompanied by a 2–8 times reduction in computational time.

show abstract

Section: Introductionmentioning

confidence: 99%

Two-Machine Flow Shop Batch Scheduling Model to Minimize Total Actual Flow Time

Yusriski,

Nasution,

Lukas

et al. 2023

Jurnal Teknik Industri

View full text Add to dashboard Cite

show abstract

“…The objective of the model addressed in this research is to minimize the total actual flowtime defines by Halim, Miyazaki and Ohta (1994a); this objective applies a backward scheduling approach to fulfill the on-time delivery. This objective has been widely adopted, such as in Hidayat, Cakravastia, Samadi and Halim (2015) dealing with the scheduling for the heterogeneous batch processor and Maulidya, Suprayogi, Wangsaputra and Halim (2017) dealing with the scheduling for Hybrid Assembly Differentiation Flowshop and many others.…”

Section: Introductionmentioning

confidence: 99%

A batch scheduling model for a three-stage flow shop with job and batch processors considering a sampling inspection to minimize expected total actual flow time

Suryadhini

Sukoyo

Suprayogi

et al. 2021

JIEM

View full text Add to dashboard Cite

Purpose: This research develops a batch scheduling model for a three-stage flow shop with job processors in the first and second stages and a batch processor in the third stage. The model integrates production process activities and a product inspection activity to minimize the expected total actual flow time.Design/methodology/approach: The problem of batch scheduling for a three-stage flow shop is formulated as a mathematical model, and a heuristic algorithm is proposed to solve the problem. This model applies backward scheduling to accommodate the objective of minimizing the expected total actual flow time.Findings: This research has proposed a batch scheduling model for a three-stage flow shop with job and batch processors to produce multiple items and an algorithm to solve the model. The objective is to minimize total actual time. The resulting production batches can be sequenced between all types of products to minimize idle time, and the batch processor capacity affects the sample size and indirectly affects the production batch size.Originality/value: This research develops a batch scheduling model for a three-stage flow shop constituting job and batch processors and carrying out integrated production and inspection activities to minimize the expected total actual flow time

show abstract

“…The following pieces of research also describe the three-stage flowshops in different perspectives. Babayan and He (2004) and Utama et al (2019) have studied the stages consisting of all machining processes, Maleki-Darounkolaei et al (2012) and Komaki et al (2017) have considered the three-stage flowshop as machining, transportation, and assembly stages, Futatsuishi et al (2002) have dealt with the flowshop where the stages consist of assembly, differentiation, and packaging stages, and Xiong et al (2015) have addressed the machining, assembly, and differentiation stages. In the mentioned studies, the systems adopt a forward job scheduling approach and consider only a single assembly operation, but there are practical cases where the approach adopted should be a backward scheduling and the assembly is with complex structures.…”

Section: Introductionmentioning

confidence: 99%

“…Komaki et al (2018) point out that an assembly structure is considered complex when it has more than one assembly operation in at least one assembly level. Maulidya et al (2018) have developed research for the case of unique and common components but ignoring the assembly structure of products. It can be observed that the practical situation of platen and assembly roller (spare parts of a printer) production applies different assembly structures processed in the same shop floor, and there is a CNC machine that can process both a unique shaft and a common bushing for platen types, and then the first assembly operation can be conducted for both components.…”

Section: Introductionmentioning

confidence: 99%

“…Equation 21 ensures a batch cannot be zero. The objective of total actual flow time for processing unique and common components has been formulated by Maulidya et al (2018). The assembly stage consists of assembly levels built from the possible alternatives of assembling the components, such as a single assembly operation on M2,1,1 (Figure 4a), a two-level assembly operation (Figure 4b), and a three-level assembly operation (Figure 4c).…”

mentioning

confidence: 99%

See 1 more Smart Citation

A Batch Scheduling Model for a Three-stage Hybrid Flowshop Producing Products with Hierarchical Assembly Structures

Maulidya¹,

Suprayogi²,

Wangsaputra³

et al. 2020

IJTech

View full text Add to dashboard Cite

This paper addresses a batch scheduling problem for a three-stage hybrid flowshop consisting of a machining stage processing common and unique components on unrelated parallel machines, an assembly stage combining the components into assembled products with complex assembly structures, and a differentiation stage processing the assembled products on dedicated machines to produce different product types. The common components are the same for all products and are processed in batches, while the unique components are dedicated to respective given product types and are processed individually (one-by-one component). The goal is to schedule all the products with different assembly structures to minimize total actual flow time (TAFT) defined as total time interval of components to be processed from their arrival times to their common due date. A non-linear programming model is proposed, where small size problems can be solved optimally using the LINGO software, and large size problems is to be solved using a heuristic algorithm. The proposed algorithm consists of two sub-algorithms. The first one is constructed using a shortest processing time (SPT) based heuristic to get a job sequence as an initial solution and the second one is to improve the initial solution using the variable neighbourhood descent (VND) method with neighbourhood insert and swap move operators. In solving the problem with the algorithm, two scenarios arise, e.g., the same and the different sequences for all stages. A set of hypothetical data is generated for different hierarchical assembly structures to test the model and the algorithm, and the results show that the different sequences for all stages obtain solutions with better performances than the same ones.

show abstract

Batch Scheduling for Hybrid Assembly Differentiation Flow Shop to Minimize Total Actual Flow Time

Cited by 7 publications

References 9 publications

Two-Machine Flow Shop Batch Scheduling Model to Minimize Total Actual Flow Time

Two-Machine Flow Shop Batch Scheduling Model to Minimize Total Actual Flow Time

A batch scheduling model for a three-stage flow shop with job and batch processors considering a sampling inspection to minimize expected total actual flow time

A Batch Scheduling Model for a Three-stage Hybrid Flowshop Producing Products with Hierarchical Assembly Structures

Contact Info

Product

Resources

About