abdul hakim halim - Academia.edu (original) (raw)
Papers by abdul hakim halim
IOP Conference Series: Materials Science and Engineering
Journal of Physics: Conference Series
To reduce inventory and pick-up costs, a mutually beneficial collaboration between suppliers and ... more To reduce inventory and pick-up costs, a mutually beneficial collaboration between suppliers and manufacturers is the basis for developing an integrated inventory and order pick-up model, known as Inbound Inventory Routing Problems (IIRP). Unfortunately, the IIRP model developed so far has not been able to accommodate several manufacturing industry problems, including vendors’ limited capacities. Concerning these conditions, this study aims to develop an IIRP model in the Multi-Vendor Single-Buyer (MVSB) systems considering suppliers’ limited capacity. The total relevant cost consisting of set-up costs, ordering costs, holding costs, and the pick-up cost is kept to a minimum. The IIRP model developed in this study is classified as mixed-integer non-linear programming (MINLP), which can be solved using an analytic, heuristic, or metaheuristic approach. Model testing was carried out on the MVSB system by developing three numerical examples. Each of them involved three suppliers of sim...
International Journal of Manufacturing Research
Journal of Physics: Conference Series
The problem investigated in this paper is arranging parts for the etching process on a single bat... more The problem investigated in this paper is arranging parts for the etching process on a single batch processor in a craft company. The company produces several different metal plate types, and each type requires another processing time and setup time. The machine also needs additional setup after processing several production batches. All metal plates that have been processed will be delivered simultaneously at the expected due date. The objective is to minimize the total actual flowtime of parts of multiple items through the shop. The problem is formulated as a mixed-integer nonlinear programming model. A simple numerical example is provided to demonstrate the execution of the mathematical model to a hypothetical question.
Journal of Industrial Engineering and Management
Purpose: This research develops a batch scheduling model for a three-stage flow shop with job pro... more 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 s...
This research has developed a batch scheduling for fabrication and assembly scheduling in a dynam... more This research has developed a batch scheduling for fabrication and assembly scheduling in a dynamic flow shop with 4-machine processing multiple items with multiple due dates to minimize the total actual flow time. Each item comprises one unit of a common component and a number of multiple unique-components each of which consists of one unit. A common component is a similar component for all items and a unique component is a specific component for each item. The fabrication process of both components is conducted on the first three machines and the assembly process is conducted on the fourth machine. The common components and the unique components are fabricated in batches for the same unique component, and the assembly process is also performed in batches for the same items. The dynamic condition in this model means that new orders may arrive at any time over the planning horizon. The new order arrivals are accommodated by totally rescheduling the initial schedule. The proposed alg...
This paper considers a batch scheduling problem of a JIT supplier and integrates production and d... more This paper considers a batch scheduling problem of a JIT supplier and integrates production and delivery decisions. Parts that have been sequenced are to be processed on a single machine, collected in a container, and sent to a customer in order to be received at a common due date. Scheduling involves the number of batches, batch sizes, scheduling of the resulting batches, and the number of vehicles delivering the batches.The objective is to minimize inventory costs wherein the holding costs of in-process parts and completed parts are distinguished. The holding cost is derived from the so-called actual flow time, defined as an interval time of parts spent in the shop since the starting time for processing a batch until its due date. The proposed problem is formulated as a non-linier programming solved by relaxing the variable of the number of batches to be a parameter. An algorithm is proposed to solve the model and tested by numerical experiences. This research shows that there is ...
Purpose: This research develops a batch scheduling model for a three-stage flow shop with job pro... more 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...
Lecture Notes in Mechanical Engineering
This paper addresses the problem of capacity planning in a Make-To-Order aircraft manufacturer co... more This paper addresses the problem of capacity planning in a Make-To-Order aircraft manufacturer company, in which order rejection is not an option. An optimization model is developed with the objective of minimizing total cost that is comprised of processing cost and lateness penalty cost. A numerical example is given to demonstrate the capability of the model. This paper also proposes a procedure for implementing the model that considers only critical resources in order to reduce the problem size such that optimal solution can be found in reasonable time.
Jurnal Rekayasa Sistem & Industri (JRSI), Sep 23, 2017
Penjadwalan batch sudah didiskusikan di beberapa penelitian. Terdapat dua jenis penjadwalan batch... more Penjadwalan batch sudah didiskusikan di beberapa penelitian. Terdapat dua jenis penjadwalan batch yaitu job processor dan batch processor. Pada job processor, part diproses secara bergantian sampai semua part dalam satu batch selesai diproses, sedangkan pada batch processor part diproses bersama dalam satu waktu sehingga waktu untuk memproses batch besarnya sama dengan waktu untuk memproses satu part. Berbeda dengan penelitian sebelumnya, pada penelitian ini waktu untuk memproses batch bukan hanya waktu untuk memproses satu part namun gabungan dari waktu yang diperlukan untuk memproses satu part dan waktu untuk memasang tools pada setiap part dalam satu batch. Penelitian ini merupakan tahap ke dua, setelah sebelumnya dikembangkan model yang sama namun untuk masalah single item dengan due date yang sama maka pada penelitian ini due date dari item berbedabeda. Model penjadwalan untuk masalah multi due date diselesaikan dengan menganggap satu interval waktu yang merupakan selisih antar dua due date yang berurutan sebagai masalah common due date. Jumlah minimum batch yang terbentuk untuk setiap interval waktu ini adalah satu dan waktu minimal untuk memproses batch besarnya sama dengan waktu untuk memproses satu part ditambah dengan waktu yang diperlukan untuk memasang tools untuk seluruh part pada satu batch. Jika waktu pada interval waktu tidak cukup untuk memproses part yang diminta pada interval waktu tersebut maka part diproses pada interval waktu setelahnya. Model diuji dengan beberapa set data hipotetik. Variabel keputusan adalah jumlah batch dan ukuran batch untuk setiap interval waktu, dan urutan pengerjaan batch sehingga akan meminimasi total waktu tinggal aktual.
IOP Conference Series: Materials Science and Engineering
This research deals with a single machine batch scheduling model considering the influenced of le... more This research deals with a single machine batch scheduling model considering the influenced of learning, forgetting, and machine deterioration effects. The objective of the model is to minimize total inventory holding cost, and the decision variables are the number of batches (N), batch sizes (Q[i], i = 1, 2, .., N) and the sequence of processing the resulting batches. The parts to be processed are received at the right time and the right quantities, and all completed parts must be delivered at a common due date. We propose a heuristic procedure based on the Lagrange method to solve the problem. The effectiveness of the procedure is evaluated by comparing the resulting solution to the optimal solution obtained from the enumeration procedure using the integer composition technique and shows that the average effectiveness is 94%.
IOP Conference Series: Materials Science and Engineering
The hybrid assembly differentiation flow shop is a three-stage flow shop system with machining, a... more The hybrid assembly differentiation flow shop is a three-stage flow shop system with machining, assembly and differentiation stages. The machining stage produces k parts in independently unrelated dedicated machines. After k parts of a job completed, they are assembled at the assembly stage and assigned to dedicated machines for a final process. At the end, several types of finished products are resulted. The finished products should be delivered at their respective different due dates. The problem is to find a schedule considering multi due dates, and the criterion of minimizing total actual flow time. This paper proposes a model for job scheduling in a hybrid assembly differentiation flow shops and its algorithm for solving the problems. The initial solution is defined using SPT-based heuristic and it is optimized using variable neighbourhood descend method. The proposed model is tested using a set of hypothetic data. The solution shows that the algorithm can solve the problems ef...
IOP Conference Series: Materials Science and Engineering, 2016
In the manufacturing industry, several identical parts can be processed in batches, and setup tim... more In the manufacturing industry, several identical parts can be processed in batches, and setup time is needed between two consecutive batches. Since the processing times of batches are not always fixed during a scheduling period due to learning and deterioration effects, this research deals with batch scheduling problems with simultaneous learning and deterioration effects. The objective is to minimize total actual flow time, defined as a time interval between the arrival of all parts at the shop and their common due date. The decision variables are the number of batches, integer batch sizes, and the sequence of the resulting batches. This research proposes a heuristic algorithm based on the Lagrange Relaxation. The effectiveness of the proposed algorithm is determined by comparing the resulting solutions of the algorithm to the respective optimal solution obtained from the enumeration method. Numerical experience results show that the average of difference among the solutions is 0.05%.
IOP Conference Series: Materials Science and Engineering, 2016
This paper studies production and delivery batch scheduling problems for a single- supplier-to-a-... more This paper studies production and delivery batch scheduling problems for a single- supplier-to-a-single-manufacturer case, with multiple capacitated vehicles wherein different holding costs between in-process and completed parts are allowed. In the problem, the parts of a single item are first batched,then the resulting batches are processed on a single machine. All completed batches are transported in a number of deliveries in order to be received at a common due date. The objective is to find the integrated schedule of production and delivery batches so as to satisfy its due date and to minimize the total cost of associated in-process parts inventory, completed parts inventory and delivery. It should be noted that both holding costs constitute a derivation of the so-called actual flow time, and the delivery cost is proportional to the required number of deliveries. The problem can be formulated as an integer non-linier programming and it is solved optimally by Lingo 11.0 software. Numerical experiences show that there are two patterns of batch sizes affected by the ratio of holding costs of in-process and completed parts. It can be used by practitioners to solve the realistic integrated production and delivery batch scheduling problem.
Purpose: This paper aims to investigate simultaneous problems of batch scheduling and operator as... more 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 mathematical model was developed for the problems, and the decision variables of the model were operator assignment, the number of batches, batch sizes and the schedule of the resulting batches. A proposed algorithm worked by trying different number of batches, starting from one, and increasing the number of batches one by one until the objective function value did not improve anymore. Findings: We mathematically and numerically show that the closest batch to the due date always became 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 al...
Jurnal Teknik Industri
This study is inspired by a batch scheduling problem in metal working industry which guarantees t... more 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.
International Journal of Technology
IOP Conference Series: Materials Science and Engineering
Journal of Physics: Conference Series
To reduce inventory and pick-up costs, a mutually beneficial collaboration between suppliers and ... more To reduce inventory and pick-up costs, a mutually beneficial collaboration between suppliers and manufacturers is the basis for developing an integrated inventory and order pick-up model, known as Inbound Inventory Routing Problems (IIRP). Unfortunately, the IIRP model developed so far has not been able to accommodate several manufacturing industry problems, including vendors’ limited capacities. Concerning these conditions, this study aims to develop an IIRP model in the Multi-Vendor Single-Buyer (MVSB) systems considering suppliers’ limited capacity. The total relevant cost consisting of set-up costs, ordering costs, holding costs, and the pick-up cost is kept to a minimum. The IIRP model developed in this study is classified as mixed-integer non-linear programming (MINLP), which can be solved using an analytic, heuristic, or metaheuristic approach. Model testing was carried out on the MVSB system by developing three numerical examples. Each of them involved three suppliers of sim...
International Journal of Manufacturing Research
Journal of Physics: Conference Series
The problem investigated in this paper is arranging parts for the etching process on a single bat... more The problem investigated in this paper is arranging parts for the etching process on a single batch processor in a craft company. The company produces several different metal plate types, and each type requires another processing time and setup time. The machine also needs additional setup after processing several production batches. All metal plates that have been processed will be delivered simultaneously at the expected due date. The objective is to minimize the total actual flowtime of parts of multiple items through the shop. The problem is formulated as a mixed-integer nonlinear programming model. A simple numerical example is provided to demonstrate the execution of the mathematical model to a hypothetical question.
Journal of Industrial Engineering and Management
Purpose: This research develops a batch scheduling model for a three-stage flow shop with job pro... more 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 s...
This research has developed a batch scheduling for fabrication and assembly scheduling in a dynam... more This research has developed a batch scheduling for fabrication and assembly scheduling in a dynamic flow shop with 4-machine processing multiple items with multiple due dates to minimize the total actual flow time. Each item comprises one unit of a common component and a number of multiple unique-components each of which consists of one unit. A common component is a similar component for all items and a unique component is a specific component for each item. The fabrication process of both components is conducted on the first three machines and the assembly process is conducted on the fourth machine. The common components and the unique components are fabricated in batches for the same unique component, and the assembly process is also performed in batches for the same items. The dynamic condition in this model means that new orders may arrive at any time over the planning horizon. The new order arrivals are accommodated by totally rescheduling the initial schedule. The proposed alg...
This paper considers a batch scheduling problem of a JIT supplier and integrates production and d... more This paper considers a batch scheduling problem of a JIT supplier and integrates production and delivery decisions. Parts that have been sequenced are to be processed on a single machine, collected in a container, and sent to a customer in order to be received at a common due date. Scheduling involves the number of batches, batch sizes, scheduling of the resulting batches, and the number of vehicles delivering the batches.The objective is to minimize inventory costs wherein the holding costs of in-process parts and completed parts are distinguished. The holding cost is derived from the so-called actual flow time, defined as an interval time of parts spent in the shop since the starting time for processing a batch until its due date. The proposed problem is formulated as a non-linier programming solved by relaxing the variable of the number of batches to be a parameter. An algorithm is proposed to solve the model and tested by numerical experiences. This research shows that there is ...
Purpose: This research develops a batch scheduling model for a three-stage flow shop with job pro... more 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...
Lecture Notes in Mechanical Engineering
This paper addresses the problem of capacity planning in a Make-To-Order aircraft manufacturer co... more This paper addresses the problem of capacity planning in a Make-To-Order aircraft manufacturer company, in which order rejection is not an option. An optimization model is developed with the objective of minimizing total cost that is comprised of processing cost and lateness penalty cost. A numerical example is given to demonstrate the capability of the model. This paper also proposes a procedure for implementing the model that considers only critical resources in order to reduce the problem size such that optimal solution can be found in reasonable time.
Jurnal Rekayasa Sistem & Industri (JRSI), Sep 23, 2017
Penjadwalan batch sudah didiskusikan di beberapa penelitian. Terdapat dua jenis penjadwalan batch... more Penjadwalan batch sudah didiskusikan di beberapa penelitian. Terdapat dua jenis penjadwalan batch yaitu job processor dan batch processor. Pada job processor, part diproses secara bergantian sampai semua part dalam satu batch selesai diproses, sedangkan pada batch processor part diproses bersama dalam satu waktu sehingga waktu untuk memproses batch besarnya sama dengan waktu untuk memproses satu part. Berbeda dengan penelitian sebelumnya, pada penelitian ini waktu untuk memproses batch bukan hanya waktu untuk memproses satu part namun gabungan dari waktu yang diperlukan untuk memproses satu part dan waktu untuk memasang tools pada setiap part dalam satu batch. Penelitian ini merupakan tahap ke dua, setelah sebelumnya dikembangkan model yang sama namun untuk masalah single item dengan due date yang sama maka pada penelitian ini due date dari item berbedabeda. Model penjadwalan untuk masalah multi due date diselesaikan dengan menganggap satu interval waktu yang merupakan selisih antar dua due date yang berurutan sebagai masalah common due date. Jumlah minimum batch yang terbentuk untuk setiap interval waktu ini adalah satu dan waktu minimal untuk memproses batch besarnya sama dengan waktu untuk memproses satu part ditambah dengan waktu yang diperlukan untuk memasang tools untuk seluruh part pada satu batch. Jika waktu pada interval waktu tidak cukup untuk memproses part yang diminta pada interval waktu tersebut maka part diproses pada interval waktu setelahnya. Model diuji dengan beberapa set data hipotetik. Variabel keputusan adalah jumlah batch dan ukuran batch untuk setiap interval waktu, dan urutan pengerjaan batch sehingga akan meminimasi total waktu tinggal aktual.
IOP Conference Series: Materials Science and Engineering
This research deals with a single machine batch scheduling model considering the influenced of le... more This research deals with a single machine batch scheduling model considering the influenced of learning, forgetting, and machine deterioration effects. The objective of the model is to minimize total inventory holding cost, and the decision variables are the number of batches (N), batch sizes (Q[i], i = 1, 2, .., N) and the sequence of processing the resulting batches. The parts to be processed are received at the right time and the right quantities, and all completed parts must be delivered at a common due date. We propose a heuristic procedure based on the Lagrange method to solve the problem. The effectiveness of the procedure is evaluated by comparing the resulting solution to the optimal solution obtained from the enumeration procedure using the integer composition technique and shows that the average effectiveness is 94%.
IOP Conference Series: Materials Science and Engineering
The hybrid assembly differentiation flow shop is a three-stage flow shop system with machining, a... more The hybrid assembly differentiation flow shop is a three-stage flow shop system with machining, assembly and differentiation stages. The machining stage produces k parts in independently unrelated dedicated machines. After k parts of a job completed, they are assembled at the assembly stage and assigned to dedicated machines for a final process. At the end, several types of finished products are resulted. The finished products should be delivered at their respective different due dates. The problem is to find a schedule considering multi due dates, and the criterion of minimizing total actual flow time. This paper proposes a model for job scheduling in a hybrid assembly differentiation flow shops and its algorithm for solving the problems. The initial solution is defined using SPT-based heuristic and it is optimized using variable neighbourhood descend method. The proposed model is tested using a set of hypothetic data. The solution shows that the algorithm can solve the problems ef...
IOP Conference Series: Materials Science and Engineering, 2016
In the manufacturing industry, several identical parts can be processed in batches, and setup tim... more In the manufacturing industry, several identical parts can be processed in batches, and setup time is needed between two consecutive batches. Since the processing times of batches are not always fixed during a scheduling period due to learning and deterioration effects, this research deals with batch scheduling problems with simultaneous learning and deterioration effects. The objective is to minimize total actual flow time, defined as a time interval between the arrival of all parts at the shop and their common due date. The decision variables are the number of batches, integer batch sizes, and the sequence of the resulting batches. This research proposes a heuristic algorithm based on the Lagrange Relaxation. The effectiveness of the proposed algorithm is determined by comparing the resulting solutions of the algorithm to the respective optimal solution obtained from the enumeration method. Numerical experience results show that the average of difference among the solutions is 0.05%.
IOP Conference Series: Materials Science and Engineering, 2016
This paper studies production and delivery batch scheduling problems for a single- supplier-to-a-... more This paper studies production and delivery batch scheduling problems for a single- supplier-to-a-single-manufacturer case, with multiple capacitated vehicles wherein different holding costs between in-process and completed parts are allowed. In the problem, the parts of a single item are first batched,then the resulting batches are processed on a single machine. All completed batches are transported in a number of deliveries in order to be received at a common due date. The objective is to find the integrated schedule of production and delivery batches so as to satisfy its due date and to minimize the total cost of associated in-process parts inventory, completed parts inventory and delivery. It should be noted that both holding costs constitute a derivation of the so-called actual flow time, and the delivery cost is proportional to the required number of deliveries. The problem can be formulated as an integer non-linier programming and it is solved optimally by Lingo 11.0 software. Numerical experiences show that there are two patterns of batch sizes affected by the ratio of holding costs of in-process and completed parts. It can be used by practitioners to solve the realistic integrated production and delivery batch scheduling problem.
Purpose: This paper aims to investigate simultaneous problems of batch scheduling and operator as... more 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 mathematical model was developed for the problems, and the decision variables of the model were operator assignment, the number of batches, batch sizes and the schedule of the resulting batches. A proposed algorithm worked by trying different number of batches, starting from one, and increasing the number of batches one by one until the objective function value did not improve anymore. Findings: We mathematically and numerically show that the closest batch to the due date always became 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 al...
Jurnal Teknik Industri
This study is inspired by a batch scheduling problem in metal working industry which guarantees t... more 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.
International Journal of Technology