Trabalho de evento

A heuristic for the stochastic single-machine problem with E/T costs (2013)

• Authors:
  • Lemos, Rafael de Freitas
  • Ronconi, Débora Pretti
• Autor USP: RONCONI, DEBORA PRETTI - EP
• Unidade: EP
• Subjects: HEURÍSTICA; PESQUISA OPERACIONAL
• Language: Inglês
• Abstract: This paper addresses the problem of simultaneous due-date determination and sequencing of a set of jobs on a stochastic single machine environment with distinct job earliness and tardiness penalty costs. It was assumed that the jobs processing times are statistically independent and follow a normal distribution whose mean and variance are given and not necessarily integer values. The objective is to determine the optimal sequence and the optimal deterministic integer due dates which jointly minimize the expected total earliness and tardiness cost. Previous theoretical results regarding normally distributed processing times and expected values of earliness and tardiness costs are reviewed. It is proposed an efficient insertion-based construction heuristic to find candidates for the optimal sequence with polynomial time complexity. It was shown that the heuristic solution method includes safety time and the sequence obtained remains the same regardless of disruptions, meaning that the result is robust. Illustrative examples and computational experiments reveal that the proposed heuristic procedure performs well and is nearly always optimal. The heuristic was applied for 680 different problems with sizes between 5 and 12 jobs, resulting in an optimality percentage of 99.85%. When applied to a sample of 480 problems with sizes between 13 and 1000 jobs, it yielded at least the same results found in the literature, providing solutions with better costs in more than 80% of cases. Furthermore, it was proved that the heuristic is asymptotically optimal, so it can be recommended for problems of any size
• Imprenta:
  • Publisher: ABEPRO
  • Publisher place: S.l
  • Date published: 2013
• Source:
  • Título: Proceedings. Challenges for sustainable operations
• Conference titles: International Conference on Production Research - ICPR

---

Download do texto completo

Tipo	Nome	Link
	Ronconi-2013-heuristic.pd...

How to cite

A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas

• ABNT

  LEMOS, Rafael de Freitas e RONCONI, Débora Pretti. A heuristic for the stochastic single-machine problem with E/T costs. 2013, Anais.. S.l: ABEPRO, 2013. Disponível em: https://repositorio.usp.br/directbitstream/f408b741-c132-48f0-94b8-b57d3288b4e7/Ronconi-2013-heuristic.pdf. Acesso em: 09 jan. 2026.

• APA

  Lemos, R. de F., & Ronconi, D. P. (2013). A heuristic for the stochastic single-machine problem with E/T costs. In Proceedings. Challenges for sustainable operations. S.l: ABEPRO. Recuperado de https://repositorio.usp.br/directbitstream/f408b741-c132-48f0-94b8-b57d3288b4e7/Ronconi-2013-heuristic.pdf

• NLM

  Lemos R de F, Ronconi DP. A heuristic for the stochastic single-machine problem with E/T costs [Internet]. Proceedings. Challenges for sustainable operations. 2013 ;[citado 2026 jan. 09 ] Available from: https://repositorio.usp.br/directbitstream/f408b741-c132-48f0-94b8-b57d3288b4e7/Ronconi-2013-heuristic.pdf

• Vancouver

  Lemos R de F, Ronconi DP. A heuristic for the stochastic single-machine problem with E/T costs [Internet]. Proceedings. Challenges for sustainable operations. 2013 ;[citado 2026 jan. 09 ] Available from: https://repositorio.usp.br/directbitstream/f408b741-c132-48f0-94b8-b57d3288b4e7/Ronconi-2013-heuristic.pdf

Últimas obras dos mesmos autores vinculados com a USP cadastradas na BDPI:

• Aplicação do método branch-and-bound na programação de tarefas em uma única máquina com data de entrega comum sob penalidades de adiantamento e atraso
• Uma heurística construtiva para o problema de minimização do atraso total no ambiente flowshop com buffer zero
• Dynamic programming approximations for a stochastics machine scheduling problem
• Tópicos em métodos de otimização para programação de tarefas e problemas correlatos
• Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
• Estudo de heurísticas para a resolução do problema do carregamento de paletes com círculos
• Minimização do tempo total de atraso no problema de flowshop com buffer zero, através de busca tabu
• New heuristics for total tardiness minimization in a flexible flowshop
• Problema de roteamento de veículos com frota mista, janelas de tempo e custos escalonados
• Tabu search for total tardiness minimization in flowshop scheduling problems