Minimizing makespan in a flow shop with two batch-processing machines using simulated annealing

Authors:
Praveen Kumar Manjeshwar;Purushothaman Damodaran;Krishnaswami Srihari
Affiliations:
Cisco Systems Inc., Austin, TX, USA;Department of Industrial and Systems Engineering, Florida International University, Miami, FL 33174, USA;Electronics Manufacturing Research and Services, Department of Systems Science and Industrial Engineering, State University of New York, Binghamton, NY 13902-6000, USA
Venue:
Robotics and Computer-Integrated Manufacturing
Year:
2009

Citing 10
Cited 4

Batching and scheduling jobs on batch and discrete processors

Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed

Computers and Operations Research
Minimizing the makespan on a batch machine with non-identical job sizes: an exact procedure

Computers and Operations Research
Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals

Computers and Operations Research
A hybrid two-stage flowshop with limited waiting time constraints

Computers and Industrial Engineering
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops

INFORMS Journal on Computing
Scheduling a capacitated batch-processing machine to minimize makespan

Robotics and Computer-Integrated Manufacturing
Mixed integer formulation to minimize makespan in a flow shop with batch processing machines

Mathematical and Computer Modelling: An International Journal
Efficient scheduling algorithms for a single batch processing machine

Operations Research Letters

Tabu search heuristic for two-machine flowshop with batch processing machines

Computers and Industrial Engineering
An effective neighborhood search algorithm for scheduling a flow shop of batch processing machines

Computers and Industrial Engineering
Research on computational intelligence algorithms with adaptive learning approach for scheduling problems with batch processing machines

Neurocomputing
Tabu search and lower bounds for a combined production-transportation problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper aims at minimizing the makespan of two batch-processing machines in a flow shop. The processing times and the sizes of the jobs are known and non-identical. The machines can process a batch as long as its capacity is not exceeded. The processing time of a batch is the longest processing time among all the jobs in that batch. The problem under study is NP-hard for makespan objective. Consequently, a heuristic based on Johnson's algorithm and a simulated annealing (SA) algorithm is proposed. Random instances were generated to verify the effectiveness of the proposed approaches. The results obtained from SA were compared with the proposed heuristic and a commercial solver. The SA outperformed both the heuristic and the commercial solver. On larger problem instances, the heuristic outperformed the commercial solver.