Efficient algorithms for scheduling semiconductor burn-in operations
Operations Research
Modeling furnace operations using simulation and heuristics
Proceedings of the 30th conference on Winter simulation
Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure
Computers and Operations Research
Computers and Operations Research
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Makespan minimization on single batch-processing machine via ant colony optimization
Computers and Operations Research
Expert Systems with Applications: An International Journal
A GRASP approach for makespan minimization on parallel batch processing machines
Journal of Intelligent Manufacturing
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Minimizing total completion time on a batch processing machine with job families
Operations Research Letters
Efficient scheduling algorithms for a single batch processing machine
Operations Research Letters
| Hi-index | 0.01 |
Scheduling unrelated parallel batch processing machines to minimize makespan is studied in this paper. Jobs with non-identical sizes are scheduled on batch processing machines that can process several jobs as a batch as long as the machine capacity is not violated. Several heuristics based on best fit longest processing time (BFLPT) in two groups are proposed to solve the problem. A lower bound is also proved to evaluate the quality of the heuristics. Computational experiments were undertaken. These showed that J_SC-BFLPT, considering both load balance of machines and job processing times, was robust and outperformed other heuristics for most of the problem categories.