<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns="http://purl.org/rss/1.0/" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel rdf:about="http://repositorio.ufc.br/handle/riufc/23507">
    <title>DSpace Coleção:</title>
    <link>http://repositorio.ufc.br/handle/riufc/23507</link>
    <description />
    <items>
      <rdf:Seq>
        <rdf:li rdf:resource="http://repositorio.ufc.br/handle/riufc/68347" />
        <rdf:li rdf:resource="http://repositorio.ufc.br/handle/riufc/68346" />
        <rdf:li rdf:resource="http://repositorio.ufc.br/handle/riufc/68345" />
        <rdf:li rdf:resource="http://repositorio.ufc.br/handle/riufc/68344" />
      </rdf:Seq>
    </items>
    <dc:date>2026-04-11T14:36:19Z</dc:date>
  </channel>
  <item rdf:about="http://repositorio.ufc.br/handle/riufc/68347">
    <title>A size-reduction algorithm for the order scheduling problem with total tardiness minimization</title>
    <link>http://repositorio.ufc.br/handle/riufc/68347</link>
    <description>Título: A size-reduction algorithm for the order scheduling problem with total tardiness minimization
Autor(es): Prata, Bruno de Athayde; Barroso, Giovanni Cordeiro; Santos, Stéphanie Alencar Braga dos
Abstract: We investigated a variant of the customer order scheduling problem taking into consideration due dates to minimize the total tardiness. Since the problem under study is NP-hard, we propose an efficient size reduction algorithm (SR). We perform an extensive computational experience and compare our proposition with JPO-20 matheuristic, the best existing algorithm for the problem under study. We use the Relative Deviation Index (RDI) and the Success Rate (SRa) as the statistical indicators for the performance measure. We must emphasize that SR presented the lowest average RDI (around 15.5 %), whereas the JPO-20 presented an average RDI approximately three times higher (around 52.5 %). Furthermore, the proposed SR presented a higher average SRa (around 66.9%), whereas the JPO-20 presented a lower average success (around 25.7%). Our proposal used a lower computational effort, resulting in a reduction for the computation times of approximately 22%. The obtained results point to the superiority of the proposed SR in comparison with the JPO-20.
Tipo: Artigo de Periódico</description>
    <dc:date>2022-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://repositorio.ufc.br/handle/riufc/68346">
    <title>Minimizing total tardiness for the order scheduling problem with sequence-dependent setup times using hybrid matheuristics</title>
    <link>http://repositorio.ufc.br/handle/riufc/68346</link>
    <description>Título: Minimizing total tardiness for the order scheduling problem with sequence-dependent setup times using hybrid matheuristics
Autor(es): Antonioli, Massimo Pinto; Rodrigues, Carlos Diego; Prata, Bruno de Athayde
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.
Tipo: Artigo de Periódico</description>
    <dc:date>2022-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://repositorio.ufc.br/handle/riufc/68345">
    <title>Desenvolvimento de um software educacional para apoio ao ensino de localização e roteirização</title>
    <link>http://repositorio.ufc.br/handle/riufc/68345</link>
    <description>Título: Desenvolvimento de um software educacional para apoio ao ensino de localização e roteirização
Autor(es): Almeida Junior, José Aurir Gonçalves; Pontes, Heráclito Lopes Jaguaribe; Albertin, Marcos Ronaldo
Abstract: Educational approaches deal with constant changes in themselves to adapt in the new digital realities that emerges from the existence of an unstoppable technologic development, prompter of deep social transformations. In this context, software’s show themselves as important tools in education for decades. Considering this importance, the motivation for this works arises from the identification of an opportunity to contribute to the education of location and routing problems in logistics courses, through the development of software with educational focus. This work starts with the definition of some technologies, adequate to its development, using them to elaborate algorithms and a graphical user interface, able of offer to the end user&#xD;
the application of location and routing methods, complementing the theoretical teaching of these subjects. The developed system is, then, verified through the comparison with some other reference systems, like LogWare®, Google® Maps and Excel®, allowing the validation as educational software, showing its advantages, limitations and opportunities for improvement.
Tipo: Artigo de Periódico</description>
    <dc:date>2019-01-01T00:00:00Z</dc:date>
  </item>
  <item rdf:about="http://repositorio.ufc.br/handle/riufc/68344">
    <title>Aplicação da Teoria de Resposta ao Item (TRI) na identificação de indicadores quantitativos discriminantes para a prática de benchmarking empresarial</title>
    <link>http://repositorio.ufc.br/handle/riufc/68344</link>
    <description>Título: Aplicação da Teoria de Resposta ao Item (TRI) na identificação de indicadores quantitativos discriminantes para a prática de benchmarking empresarial
Autor(es): Baltazar, Marcos Charles Pinheiro; Albertin, Marcos Ronaldo; Pontes, Heráclito Lopes Jaguaribe
Abstract: Benchmarking as a management tool is based on practices and metrics. However, there are latent variables that cannot be measured directly. The Item Response Theory (IRT), a statistical technique that is widely explored in the health area, is little explored in the management area. This work seeks to apply the IRT to identify a set of indicators that are discriminative and possible to be used in the practice of business benchmarking. After analysing 31 indicators of 203 companies listed on the São Paulo Stock Exchange, it was possible to identify 21 discriminating indicators divided into 5 factors. It was concluded that IRT is a technique capable of identifying discriminatory indicators with low value of the Root Mean Square Error of Approximation (RMSEA) and that itbrings new interpretations of already existing metrics -in the case economic and financial metrics -in addition to facilitating the understanding latent traits.
Tipo: Artigo de Periódico</description>
    <dc:date>2021-01-01T00:00:00Z</dc:date>
  </item>
</rdf:RDF>

