scholarly journals A single machine multi-job integer batch scheduling problem with multi due date to minimize total actual flow time

2021 ◽  
Vol 10 (3) ◽  
pp. 231-240
Author(s):  
Rinto Yusriski ◽  
Budi Astuti ◽  
Damawijaya Biksono ◽  
Tika Ayu Wardani
Keyword(s):  
Single Machine ◽  
Flow Time ◽  
Batch Scheduling ◽  
Batch Size ◽  
Simple Problem ◽  
Scheduling Problem ◽  
Due Dates ◽  
Due Date ◽  
Numerical Experience ◽  
Actual Flow

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.

scholarly journals Multi-items Batch Scheduling Model for a Batch Processor to Minimize Total Actual Flow Time of Parts through the Shop

2018 ◽  
Vol 20 (1) ◽  
pp. 73-88
Author(s):  
Nita P.A Hidayat ◽  
Andi Cakravastia ◽  
T.M.A Ari Samadhi ◽  
Abdul Hakim Halim
Keyword(s):  
Flow Time ◽  
Batch Scheduling ◽  
Scheduling Problem ◽  
Metal Working ◽  
Due Dates ◽  
Due Date ◽  
Batch Processor ◽  
Scheduling Model ◽  
Actual Flow

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.

scholarly journals Integer Batch Scheduling Problems for a Single-Machine to Minimize Total Actual Flow Time

2015 ◽  
Vol 2 ◽  
pp. 118-123 ◽  
Author(s):  
Rinto Yusriski ◽  
Budi Astuti ◽  
Sukoyo ◽  
T.M.A. Ari Samadhi ◽  
Abdul Hakim Halim
Keyword(s):  
Single Machine ◽  
Flow Time ◽  
Batch Scheduling ◽  
Scheduling Problems ◽  
Actual Flow

Single machine batch scheduling problem with fuzzy batch size

2012 ◽  
Vol 62 (3) ◽  
pp. 688-692 ◽  
Author(s):  
Xuesong Li ◽  
Hiroaki Ishii ◽  
Teruo Masuda
Keyword(s):  
Single Machine ◽  
Batch Scheduling ◽  
Batch Size ◽  
Scheduling Problem

Due-Date Assignment on a Single Machine Scheduling Problem with Nonlinear Deterioration Function

2013 ◽  
Vol 645 ◽  
pp. 280-284
Author(s):  
Hua Ping Wu ◽  
Min Huang ◽  
Vincent Cho ◽  
W.H. Ip ◽  
Xing Wei Wang
Keyword(s):  
Single Machine ◽  
Real World ◽  
Processing Time ◽  
Single Machine Scheduling ◽  
Scheduling Problem ◽  
Due Dates ◽  
Due Date ◽  
Due Date Assignment ◽  
Non Linear ◽  
Normal Processing

The paper considers the due-date assignment problem with a non-linear deterioration in which the due dates are determined by the equal slack method. Here, the processing time of a job is defined by a non-linear function of total normal processing time of jobs in front of it in the sequence. The objective is to minimize the total tardiness penalties. According to the needs from the real world, the problem is divided into two cases, i.e., allowing with early jobs and no early jobs respectively. The related lemma, corollary and theorems for the problems are proposed and proved. At the same time, it shows that the problems in this paper can be solved in the polynomial times.

scholarly journals Integer Relaxation on Binary Quadratic Programming for Batching and Sequencing in Single Formulation to Minimize Total Actual Flow Times Criteria

2011 ◽  
Vol 2 (2) ◽  
pp. 1083
Author(s):  
Zahedi Zahedi
Keyword(s):  
Batch Scheduling ◽  
Scheduling Problem ◽  
Numerical Experience ◽  
Single Item ◽  
Binary Constraints ◽  
Decision Variables ◽  
Multiple Item ◽  
Batch Sizes ◽  
Actual Flow ◽  
Integer Relaxation

This paper examines batch scheduling problem that has batching and sequencing in single formulation for multiple-item case. The first step is to develop a model for single item single resource discussed in Zahedi (2008). The model determined batch sizes and their schedule simultaneously in single item case. This paper develops the model and algorithm for multiple-item case. The model functions to minimize total actual flow times. An algorithm for the model is developed using a relaxation of the binary constraints. The binary values for the decision variables are obtained from steps provided in algorithm. A numerical experience showing characteristics of this problem is presented. 

Sign in / Sign up

Export Citation Format

Share Document