Single Machine Batch Scheduling Problem with Resource Dependent Setup and Processing Time in the Presence of Fuzzy Due Date

2005 ◽  
Vol 4 (2) ◽  
pp. 141-147 ◽  
Author(s):  
Kanthen K Harikrishnan ◽  
Hiroaki Ishii
Keyword(s):  
Single Machine ◽  
Processing Time ◽  
Batch Scheduling ◽  
Scheduling Problem ◽  
Due Date

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 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.

A Batch Scheduling Problem with Two Agents

2015 ◽  
Vol 32 (06) ◽  
pp. 1550044 ◽  
Author(s):  
Byung-Cheon Choi ◽  
Myoung-Ju Park
Keyword(s):  
Approximation Algorithm ◽  
Optimality Conditions ◽  
Single Machine ◽  
Completion Time ◽  
Polynomial Algorithm ◽  
Batch Scheduling ◽  
Scheduling Problem ◽  
Np Hard ◽  
Due Date ◽  
Processing Times

In this paper, we consider a two-agent batch scheduling problem on a single machine such that the processing times of agent 1 and the due date of agent 2 in the same batch are identical. The objective is to minimize the total completion time of agent 1 with a constraint on the maximum tardiness of agent 2. First, we propose the optimality conditions. Then, we show that the problem is strongly NP-hard. Finally, we prove the problem remains NP-hard even for the case with one batch of agent 2, and develop a pseudo-polynomial algorithm and an approximation algorithm for this case.

Sign in / Sign up

Export Citation Format

Share Document