A complex time based construction heuristic for batch scheduling problems in the chemical industry |
| |
| Institution: | 1. Department of Information Systems and Business Analytics, Florida International University, Miami, FL 33199, United States\n;2. Carey Business School, Johns Hopkins University 100 International Drive, Baltimore, MD 21202, United States;1. School of Business Administration, The Hebrew University, Jerusalem 91905, Israel;2. School of Industrial Engineering, Jerusalem College of Technology, Jerusalem, Israel;3. Department of Economics and Business Management, Ariel University, Israel;1. Department of Industrial Engineering, PUC-Rio, Rua Marquês de São Vicente, 225, Gávea 22453-900, Rio de Janeiro (RJ), Brazil;2. AT&T Labs Research, 200 South Laurel Avenue, Middletown, NJ 07748, USA;1. University of São Paulo São Paulo, SP 05508-010;2. Technological Research Institute São Paulo, SP 05508-280;3. Industrial Algorithms Ltd. Toronto, ON MIP-4C3 |
| |
| Abstract: | In this paper we investigate a heuristic for batch processing problems occurring in the chemical industry, where the objective is to minimize the makespan. Usually, this kind of problem is solved using mixed-integer linear programs. However, due to the large number of binary variables good results within a reasonable computational time could only be obtained for small instances.We propose an iterative construction algorithm which alternates between construction and deconstruction phases. Moreover, we suggest diversification and intensification strategies in order to obtain good suboptimal solutions within moderate running times. Computational results show the power of this algorithm. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
