Minimizing total flow time on a batch processing machine using a hybrid max–min ant system

•The problem of minimizing total flow time on a single batch processing machine with non-identical job sizes is addressed.•A binary mixed integer programming model is formulated.•An effective hybrid max–min ant system is proposed.•The effectiveness of the proposed approach is evaluated using randoml...

Full description

Saved in:

Bibliographic Details
Published in:	Computers & industrial engineering Vol. 99; pp. 372 - 381
Main Authors:	Rafiee Parsa, N., Karimi, B., Moattar Husseini, S.M.
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.09.2016 Pergamon Press Inc
Subjects:	Algorithms Ant colony optimization Batch processing Batch processing machines Computer simulation Dynamic programming Dynamical systems Heuristic Integer programming Job shops Mathematical models Max–min ant system Optimization algorithms Polymethyl methacrylates Production scheduling Searching Semiconductor manufacturing Studies Total flow time Total flow time Max–min ant system Dynamic programming Semiconductor manufacturing Batch processing machines
ISSN:	0360-8352, 1879-0550
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!