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

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 Single-Machine Parallel-Batch Scheduling with Nonidentical Job Sizes and Rejection

Mathematics ◽  
2020 ◽  
Vol 8 (2) ◽  
pp. 258
Author(s):  
Miaomiao Jin ◽  
Xiaoxia Liu ◽  
Wenchang Luo
Keyword(s):  
Integer Programming ◽  
Single Machine ◽  
Heuristic Algorithms ◽  
Batch Processing ◽  
Batch Scheduling ◽  
Scheduling Problem ◽  
Programming Formulation ◽  
Processing Times ◽  
Batch Processing Machine ◽  
Rejection Penalty

We investigate the single-machine parallel-batch scheduling problem with nonidentical job sizes and rejection. In this problem, a set of jobs with different processing times and nonidentical sizes is given to be possibly processed on a parallel-batch processing machine. Each job is either accepted and then processed on the machine or rejected by paying its rejection penalty. Preemption is not allowed. Our task is to choose the accepted jobs and schedule them as batches on the machine to minimize the makespan of the accepted jobs plus the total rejection penalty of the rejected jobs. We provide an integer programming formulation to exactly solve our problem. Then, we propose three fast heuristic algorithms to solve the problem and evaluate their performances by using a small numerical example.

Sign in / Sign up

Export Citation Format

Share Document