Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1704787 | Applied Mathematical Modelling | 2012 | 13 Pages |
Abstract
This paper investigates single-batch and batch-single flow shop scheduling problem taking transportation among machines into account. Both transportation capacity and transportation times are explicitly considered. While the single processing machine processes one job at a time, the batch processing machine processes a batch of jobs simultaneously. The batch processing time is the longest processing times of jobs assigned to that batch.Each problem is formulated as a mixed integer programming model to find optimal makespan. Lower bounds and heuristic algorithms are proposed and computational experiments are carried out to verify their effectiveness.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
J. Behnamian, S.M.T. Fatemi Ghomi, F. Jolai, O. Amirtaheri,