Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Minimizing total tardiness for the order scheduling problem with sequence-dependent setup times using hybrid matheuristics

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • Additional Information
    • Publication Information:
      Growing Science, 2022.
    • Publication Date:
      2022
    • Collection:
      LCC:Industrial engineering. Management engineering
      LCC:Production management. Operations management
    • Abstract:
      This paper aims at presenting a customer order scheduling environment in which the setup times are explicit and depend on the production sequence. The considered objective function is the total tardiness minimization. Since the variant under study is NP-hard, we propose a mixed-integer linear programming (MILP) model, an adaptation of the Order-Scheduling Modified Due-Date heuristic (OMDD) (referred to as Order-Scheduling Modified Due-Date Setup (OMMD-S)), an adaptation of the Framinan and Perez-Gonzalez heuristic (FP) (hereinafter referred to as Framinan and Perez-Gonzalez Setup (FP-S)), a matheuristic with Same Permutation in All Machines (SPAM), and the hybrid matheuristic SPAM-SJPO based on Job-Position Oscillation (JPO). The algorithms under comparison have been compared on an extensive benchmark of randomly generated test instances, considering two performance measures: Relative Deviation Index (RDI) and Success Rate (SR). For the small-size evaluated instances, the SPAM is the most efficient algorithm, presenting the better values of RDI and SR. For the large-size evaluated instances, the hybrid matheuristic SPAM-JPO and MILP model are the most efficient methods.
    • File Description:
      electronic resource
    • ISSN:
      1923-2926
      1923-2934
    • Relation:
      http://www.growingscience.com/ijiec/Vol13/IJIEC_2021_30.pdf; https://doaj.org/toc/1923-2926; https://doaj.org/toc/1923-2934
    • Accession Number:
      10.5267/j.ijiec.2021.11.002
    • Accession Number:
      edsdoj.0667428dff6b4a3c9a33f281e4b41d80