A Batch Scheduling and Operator Assignment Model with Time-Changing Effects to Minimise Total Actual Flow Time

2022 ◽  
Vol 17 (4) ◽  
pp. 1
Author(s):  
Dwi Kurniawan ◽  
Andi Cakravastia ◽  
Suprayogi Suprayogi ◽  
Abdul Hakim Halim
2020 ◽  
Vol 13 (3) ◽  
pp. 546
Author(s):  
Dwi Kurniawan ◽  
Andi Cakravastia Raja ◽  
Suprayogi Suprayogi ◽  
Abdul Hakim Halim

Purpose: This paper aims to investigate simultaneous problems of batch scheduling and operator assignment with time-changing effects caused by learning and forgetting.Design/methodology/approach: A number of parts will be processed in batches, each of which will be processed through a number of operations where there are alternative operators for each operation bringing different set up and processing times as operators experience different degree of learning and forgetting. A mathematical model is developed for the problems, and the decision variables are operator assignment, the number of batches, batch sizes and the schedule of the resulting batches. A proposed algorithm works by trying different number of batches, starting from one, and increasing the number of batches one by one until the objective function value does not improve anymore.Findings: We show both mathematically and numerically that the closest batch to the due date always becomes the largest batch in the schedule, and the faster operators learn, the larger the difference between the closest batch to the due date and the other batches, the lower optimal number of batches, and the lower the total actual flow time.Originality/value: Previous papers have considered the existence of alternative operators but have not considered learning and forgetting, or have considered learning and forgetting but only in a single-stage system and without considering alternative operators.


2015 ◽  
Vol 2 ◽  
pp. 118-123 ◽  
Author(s):  
Rinto Yusriski ◽  
Budi Astuti ◽  
Sukoyo ◽  
T.M.A. Ari Samadhi ◽  
Abdul Hakim Halim

2021 ◽  
Vol 10 (3) ◽  
pp. 231-240
Author(s):  
Rinto Yusriski ◽  
Budi Astuti ◽  
Damawijaya Biksono ◽  
Tika Ayu Wardani

This research deals with a multi-job Integer batch scheduling problem on a single machine with different due dates. Every job demanded one or more parts, and the single machine processed the job into a number of batches. The objective is to minimize total actual flow time, defined as the total flow time of all jobs starting from the arrival to the common due date. The decisions are to determine the sequence of jobs, the number of batches, batch size, and sequence of all batches on a single machine. This research proposes three algorithms, developed based on the longest due date rule (The P1-LDD Algorithm), the adjacent pairwise interchange method (The P2-API Algorithm), and the permutation method (The P3-PM Algorithm). The numerical experience shows that the three algorithms produce an outstanding solution. The P1-LDD Algorithm fits to solve a simple problem. The P2-API Algorithm has superior to solve a big complicated problem. The P3-PM Algorithm has the best performance to solve small complicated problems.


2021 ◽  
Vol 14 (3) ◽  
pp. 520
Author(s):  
Pratya Poeri Suryadhini ◽  
Sukoyo Sukoyo ◽  
Suprayogi Suprayogi ◽  
Abdul Hakim Halim

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


2018 ◽  
Vol 20 (1) ◽  
pp. 73-88
Author(s):  
Nita P.A Hidayat ◽  
Andi Cakravastia ◽  
T.M.A Ari Samadhi ◽  
Abdul Hakim Halim

This study is inspired by a batch scheduling problem in metal working industry which guarantees to satisfy a due date as a commitment to customers. Actual flowtime adopts the backward scheduling approach and considers the due date. Using the actual flowtime as the objective means that the solution  is oriented to satisfy the due date, and simultaneosly to minimize the length of time of the parts spending in the shop. This research is to address a problem of scheduling batches consisting of multiple items of parts processed on a batch processor where the completed parts must be delivered several time at different due dates. We propose an algorithm to solve the problem.


Author(s):  
Ömer Faruk Yılmaz ◽  
Mehmet Bülent Durmuşoğlu

There are three main problems that could impact the performance of a Hybrid Manufacturing System (HMS): (1) order release (OR), (2) batch scheduling and (3) worker assignment. This paper deals with these three main problems hierarchically for an HMS. Three different mathematical models are developed to describe the problems more clearly. A novel methodology is proposed to adopt a holistic approach to these problems and find an effective solution. Implementation of the proposed methodology permits integrating batch scheduling and worker timetabling. Feasible solutions in the best-known Pareto front are evaluated as alternative solutions. The goal is to select a preferred solution that satisfies worker constraints, creates effective worker teams in cells, minimizes the number of utility workers, and the average flow time. The study also presents several improvements, which are made following the application of the proposed methodology to a real company that produces expansion joints.


Sign in / Sign up

Export Citation Format

Share Document