Advanced search
Start date
Betweenand
Related content
(Reference retrieved automatically from Web of Science through information on FAPESP grant and its corresponding number as mentioned in the publication by the authors.)

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

Full text
Author(s):
Lemos, R. F. [1] ; Ronconi, D. P. [1]
Total Authors: 2
Affiliation:
[1] Univ Sao Paulo, Dept Prod Engn, EPUSP, BR-05508070 Sao Paulo, SP - Brazil
Total Affiliations: 1
Document type: Journal article
Source: INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS; v. 168, p. 131-142, OCT 2015.
Web of Science Citations: 1
Abstract

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)

FAPESP's process: 13/07375-0 - CeMEAI - Center for Mathematical Sciences Applied to Industry
Grantee:Francisco Louzada Neto
Support Opportunities: Research Grants - Research, Innovation and Dissemination Centers - RIDC
FAPESP's process: 10/10133-0 - Cutting, packing, lot-sizing and scheduling problems and their integration in industrial and logistics settings
Grantee:Reinaldo Morabito Neto
Support Opportunities: Research Projects - Thematic Grants