No abstract

No abstract

No abstract

This paper studies the typical batching and scheduling problem of parallel flowshop, which is characterized by multi-product, multi-stage, parallel production, production coordination between stages, limit of equipment production capacity and inventory capacity, parallel equipment selection and limitation of batch quantity. This paper presents modified quantum evolutionary algorithm(MQEA) with continuous codes representing the batch size on the every stage to enhance the ability to handle constraints. The computational results show that the MQAE may find optimal or suboptimal solutions in a short run time for all the instances.

In this paper we study a logistics park location planning problem in which logistics park has variable capacities related to the park size that is decided in the given range and the size ranges are different in every potential location site. We introduce the design modes to deal with the nonlinear tracts cost function and obtain an integer programming model. Then column generation is used to solve the model to get a good low bound. Based on the lower bound, we obtain the best solution by tabu search. New columns are generated considering knapsack subproblems. Computational tests are presented using random data.