IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v59y2021i10p3169-3184.html
   My bibliography  Save this article

Continuous-time formulation and differential evolution algorithm for an integrated batching and scheduling problem in aluminium industry

Author

Listed:
  • Qingxin Guo
  • Lixin Tang
  • Jiyin Liu
  • Shengnan Zhao

Abstract

This paper investigates an integrated batching and scheduling problem of electrolysis and caster in aluminium industry. The problem is to determine the assignment and scheduling of orders considering sequence-dependent setup times caused by technological and operational constraints of electrolysis cells, and determine the batching and scheduling of orders in the following casters. A novel unit-specific event-based continuous-time mixed integer linear programming model (MILP) is proposed to describe the problem. In this model, the event point is stage specific, and lower bounds are specified to tighten the model. A hybrid pointer-based differential evolution algorithm with new individual representation scheme is designed to solve the problem of industrial scale. An improved hybrid pointer-based mutation operator and a new point-cross crossover operator are proposed to enhance the performance of the algorithm. Computational experiments show that the proposed algorithm is more efficient when compared with CPLEX for medium and large size instances. Comparisons with the lower bound demonstrate that the algorithm is effective.

Suggested Citation

  • Qingxin Guo & Lixin Tang & Jiyin Liu & Shengnan Zhao, 2021. "Continuous-time formulation and differential evolution algorithm for an integrated batching and scheduling problem in aluminium industry," International Journal of Production Research, Taylor & Francis Journals, vol. 59(10), pages 3169-3184, May.
    • Handle: RePEc:taf:tprsxx:v:59:y:2021:i:10:p:3169-3184
    DOI: 10.1080/00207543.2020.1747656
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2020.1747656
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2020.1747656?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:59:y:2021:i:10:p:3169-3184. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.