Busca avançada
Ano de início
Entree
(Referência obtida automaticamente do Web of Science, por meio da informação sobre o financiamento pela FAPESP e o número do processo correspondente, incluída na publicação pelos autores.)

Heuristics for the stochastic single-machine problem with E/T costs

Texto completo
Autor(es):
Lemos, R. F. [1] ; Ronconi, D. P. [1]
Número total de Autores: 2
Afiliação do(s) autor(es):
[1] Univ Sao Paulo, Dept Prod Engn, EPUSP, BR-05508070 Sao Paulo, SP - Brazil
Número total de Afiliações: 1
Tipo de documento: Artigo Científico
Fonte: INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS; v. 168, p. 131-142, OCT 2015.
Citações Web of Science: 1
Resumo

This paper addresses the problem of concurrent due-date assignment and sequencing of a set of jobs on a stochastic single-machine environment with distinct job earliness and tardiness penalty costs. It is assumed that the jobs processing times are statistically independent and follow a normal distribution whose mean and variance are provided. The objective is to determine the job sequence and the due dates which minimize the expected total earliness and tardiness costs. Previous theoretical results regarding normally distributed processing times and expected values of earliness and tardiness costs are reviewed. Two efficient insertion-based constructive heuristics with polynomial time complexity are proposed. It is shown that both heuristic solution methods include safety time and the obtained sequence remains the same regardless of disruptions, which means that the results are robust. A comparative study with known methods from the literature was conducted using a set of 1700 problems with up to 2000 jobs. The results indicated that the best performance was achieved by one of the developed heuristics. Furthermore, it was proven that the heuristics are asymptotically optimal. An extension of the problem with processing times modeled as lognormal random variables was also investigated and solved with good results. (C) 2015 Elsevier B.V. All rights reserved. (AU)

Processo FAPESP: 13/07375-0 - CeMEAI - Centro de Ciências Matemáticas Aplicadas à Indústria
Beneficiário:Francisco Louzada Neto
Modalidade de apoio: Auxílio à Pesquisa - Centros de Pesquisa, Inovação e Difusão - CEPIDs
Processo FAPESP: 10/10133-0 - Problemas de corte, empacotamento, dimensionamento de lotes e programação da produção, e suas integrações em contextos industriais e logísticos
Beneficiário:Reinaldo Morabito Neto
Modalidade de apoio: Auxílio à Pesquisa - Temático