A job-family-oriented algorithm for re-entrant batch processing machine scheduling

2013 ◽  
Author(s):  
Wenyou Jia ◽  
Zhibin Jiang ◽  
You Li
Keyword(s):  
Machine Scheduling ◽  
Batch Processing ◽  
Processing Machine ◽  
Batch Processing Machine

Optimal Semi-Online Algorithm for Scheduling on Two Parallel Batch Processing Machines

2014 ◽  
Vol 31 (05) ◽  
pp. 1450038 ◽  
Author(s):  
Ming Liu ◽  
Feifeng Zheng ◽  
Zhanguo Zhu ◽  
Chengbin Chu
Keyword(s):  
Processing Time ◽  
Online Algorithm ◽  
Machine Scheduling ◽  
Batch Processing ◽  
Batch Processing Machines ◽  
Uncertain Environment ◽  
Processing Machine ◽  
Processing Times ◽  
Batch Processing Machine ◽  
Over Time

Batch processing machine scheduling in uncertain environment attracts more and more attention in the last decade. This paper deals with semi-online scheduling on two parallel batch processing machines with non-decreasing processing time of job. Jobs arrive over time in the online paradigm, and the processing time of any batch is equal to the length of the last arrival job in the batch. We study the unbounded model where each processing batch may contain an unlimited number of jobs, and the objective is to minimize the makespan. Given any job Jj together with its following job Jj+1, it is assumed that their processing times satisfy pj+1 ≥ αpj where α ≥ 1 is a constant. That is, jobs arrive in a non-decreasing order of processing times. We mainly propose an optimal ϕ-competitive online algorithm where ϕ ≥ 1 is a solution of equation ϕ3 + (α-1)ϕ2 + (α2 - α - 1)ϕ - α2 = 0.

scholarly journals Arc-flow approach for single batch-processing machine scheduling

2021 ◽  
pp. 105394
Author(s):  
Renan Spencer Trindade ◽  
Olinto César Bassi de Araújo ◽  
Marcia Fampa
Keyword(s):  
Machine Scheduling ◽  
Batch Processing ◽  
Processing Machine ◽  
Batch Processing Machine ◽  
Single Batch
Sign in / Sign up

Export Citation Format

Share Document