Heuristic Algorithm for Scheduling of Make-to-Order Plant Factory with Considering Crops Size Variation during Cultivation
Date Issued
2015
Date
2015
Author(s)
Wei, Chin-Shao
Abstract
Plant factory is an environmental controlled facility which can sustain the stable crop cultivation with fast production and better quality by controlling temperature, humidity, lighting, nutrient supply and other cultivating factors. In this research, focus on production scheduling problem of ordering based (Make-to-Order) plant factory and consider size change as time past of crops. The scheduling problem was formulated as a mixed integer programming (MIP) problem. The objective function is to seek the maximum revenue of the plant factory by considering several practical operating conditions such as cultivation room space, environmental constraints, crop, due day of order. The operating conditions are formulated as constraints, and the MIP problem was solved by LINGO programming model to obtain the optimal solution. The computation time of LINGO solver is exponentially increasing when the problem domain is larger. Therefore, we propose the heuristic algorithm (HOBPFS) to solve the large size problem instance, which result show that our heuristic algorithm can indeed get good feasible solutions.
Subjects
Plant Factory
Production Scheduling
Make-to-Order
Mixed Integer Programming
Heuristic Algorithm
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-104-R02546022-1.pdf
Size
23.54 KB
Format
Adobe PDF
Checksum
(MD5):eb6f0e3c9af7278d9082d2056d40f0eb