Scholars Central

Research articlePublished 31 Oct 2015

Improved Tabu search algorithm to optimize the scheduling problem

Authors: Zhou Cuihong

Journal of Chemical and Pharmaceutical Research

Volume 7 · Issue 10 · Pages 797–803

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

Improved tabu search is proposed to solve the multi product continuous manufacturing facilities schedul ing problem. The problem is formulated as a mixed-integer linear programming (MILP) model. The mathematical model h as a linear objective function to be maximized. The prob lem is NP-hard and finding an optimal solution effi ciently is unlikely. Therefore, heuristic techniques are more appropriate to find near-optimal solutions. The com putational results are compared to manual experimental results in the plant and show that the effectiveness and a pplicability of the proposed methods.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Chemical and Pharmaceutical Research.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Chemical and Pharmaceutical Research
  • SubjectPharmaceutical Sciences
  • SubjectChemistry
  • BylineArticles whose byline prints “Zhou Cuihong”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels