Scheduling of Identical Parallel-batch Processing Machines with Variable Machine Capacity and None-identical Job Sizes

Please enable javascript in your browser.

Hamedinia, Abdolghaium | 2013

443 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 44625 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Kianfar, Ferydoon
Abstract:
In this thesis, we consider the problem of scheduling parallel batching machines with different machine capacity and jobs of arbitrary sizes and processing times. The machines have identical processing velocity. The jobs are processed in batches given that the total size of jobs in a batch cannot exceed the machine capacity. Once a batch starts processing, no interruption is allowed until all the jobs are completed. First we present a mixed integer programming model of the problem. We show the computational complexity of the problem, and then we propose two heuristics, LPT-BF and LPT-FF with regard to constraints of problem. Finally, we generate different scales of instances to test the performance. The computational results show the effectiveness of the algorithm, especially for large-scale instances
Keywords:
Scheduling ; Parallel Machines ; Heuristic Algorithm ; Mathematical Modeling ; Different Machine Capacity ; Mixed Integer Programming

No TOC