Note: Minimizing makespan with release times on identical parallel batching machines

Authors:
Shuguang Li;Guojun Li;Shaoqiang Zhang
Affiliations:
Department of Mathematics and Information Science, Yantai University, Yantai 264005, People's Republic of China;Institute of Software, Chinese Academy of Sciences, Beijing 100080, People's Republic of China and School of Mathematics and Systems Science, Shandong University, Jinan 250100, People's Republic o ...;School of Computer and Information Engineering, Tianjin Normal University, Tianjin 300074, People's Republic of China
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 3
Cited 4

Efficient algorithms for scheduling semiconductor burn-in operations

Operations Research
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximation schemes for constrained scheduling problems

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

A simulated annealing algorithm to minimize makespan of parallel batch processing machines with unequal job ready times

Expert Systems with Applications: An International Journal
A GRASP approach for makespan minimization on parallel batch processing machines

Journal of Intelligent Manufacturing
A PTAS for scheduling on agreeable unrelated parallel batch processing machines with dynamic job arrivals

AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan

Operations Research Letters

Quantified Score

Hi-index	0.05

Visualization

Abstract

We consider the problem of scheduling n jobs on m identical parallel batching machines. Each job is characterized by a release time and a processing time. Each machine can process up to B(B