Competitive strategy in the scheduling of multiproduct batch processes with due-date penalties

R. C. Batista, J. V. Bontempo, M. Castier

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The production scheduling of N products in an M-unit serial multiproduct batch process was studied. As customer satisfaction is one of the most important considerations in the operation of many batch processes, the objective was to minimize the total penalty due to late deliveries of certain products. A penalty factor was developed to substitute the direct use of product prices, taking into account aspects of marketing, customer/supplier relationship, profit, and aspects related to the size of the customer and to the kind of product. To determine the penalty assigned to each product, this factor is multiplied by the tardiness (difference between the completion time of a product and its due-date). As many products are involved, the total penalty is the sum of product penalties. In this work, the Simulated Annealing (SA) optimization algorithm was used to solve the scheduling problems. An alternative to SA was also developed based on a modification of the Rapid Access (RA) heuristics to obtain the initial sequence with the inclusion of penalty factors and due-dates. The performance of this method was compared to that of other heuristics. An algorithm that allows the inclusion of new orders for other products during the processing of a previously determined sequence of products was also developed.

Original languageEnglish
Pages (from-to)251-256
Number of pages6
JournalLatin American Applied Research
Volume28
Issue number4
Publication statusPublished - 1998
Externally publishedYes

Fingerprint

Simulated annealing
Scheduling
Customer satisfaction
Marketing
Profitability
Processing

Keywords

  • Batch Process
  • Competitive Strategy
  • Due-Date Penalty
  • Heuristic Methods
  • Scheduling

ASJC Scopus subject areas

  • Chemical Engineering(all)

Cite this

Competitive strategy in the scheduling of multiproduct batch processes with due-date penalties. / Batista, R. C.; Bontempo, J. V.; Castier, M.

In: Latin American Applied Research, Vol. 28, No. 4, 1998, p. 251-256.

Research output: Contribution to journalArticle

@article{225a3ad6a77f4901a9e5153e86ec9599,
title = "Competitive strategy in the scheduling of multiproduct batch processes with due-date penalties",
abstract = "The production scheduling of N products in an M-unit serial multiproduct batch process was studied. As customer satisfaction is one of the most important considerations in the operation of many batch processes, the objective was to minimize the total penalty due to late deliveries of certain products. A penalty factor was developed to substitute the direct use of product prices, taking into account aspects of marketing, customer/supplier relationship, profit, and aspects related to the size of the customer and to the kind of product. To determine the penalty assigned to each product, this factor is multiplied by the tardiness (difference between the completion time of a product and its due-date). As many products are involved, the total penalty is the sum of product penalties. In this work, the Simulated Annealing (SA) optimization algorithm was used to solve the scheduling problems. An alternative to SA was also developed based on a modification of the Rapid Access (RA) heuristics to obtain the initial sequence with the inclusion of penalty factors and due-dates. The performance of this method was compared to that of other heuristics. An algorithm that allows the inclusion of new orders for other products during the processing of a previously determined sequence of products was also developed.",
keywords = "Batch Process, Competitive Strategy, Due-Date Penalty, Heuristic Methods, Scheduling",
author = "Batista, {R. C.} and Bontempo, {J. V.} and M. Castier",
year = "1998",
language = "English",
volume = "28",
pages = "251--256",
journal = "Latin American Applied Research",
issn = "0327-0793",
publisher = "PLAPIQUI Planta Piloto de Ingenieria Quimica, CONICET / Universidad Nacional del Sur",
number = "4",

}

TY - JOUR

T1 - Competitive strategy in the scheduling of multiproduct batch processes with due-date penalties

AU - Batista, R. C.

AU - Bontempo, J. V.

AU - Castier, M.

PY - 1998

Y1 - 1998

N2 - The production scheduling of N products in an M-unit serial multiproduct batch process was studied. As customer satisfaction is one of the most important considerations in the operation of many batch processes, the objective was to minimize the total penalty due to late deliveries of certain products. A penalty factor was developed to substitute the direct use of product prices, taking into account aspects of marketing, customer/supplier relationship, profit, and aspects related to the size of the customer and to the kind of product. To determine the penalty assigned to each product, this factor is multiplied by the tardiness (difference between the completion time of a product and its due-date). As many products are involved, the total penalty is the sum of product penalties. In this work, the Simulated Annealing (SA) optimization algorithm was used to solve the scheduling problems. An alternative to SA was also developed based on a modification of the Rapid Access (RA) heuristics to obtain the initial sequence with the inclusion of penalty factors and due-dates. The performance of this method was compared to that of other heuristics. An algorithm that allows the inclusion of new orders for other products during the processing of a previously determined sequence of products was also developed.

AB - The production scheduling of N products in an M-unit serial multiproduct batch process was studied. As customer satisfaction is one of the most important considerations in the operation of many batch processes, the objective was to minimize the total penalty due to late deliveries of certain products. A penalty factor was developed to substitute the direct use of product prices, taking into account aspects of marketing, customer/supplier relationship, profit, and aspects related to the size of the customer and to the kind of product. To determine the penalty assigned to each product, this factor is multiplied by the tardiness (difference between the completion time of a product and its due-date). As many products are involved, the total penalty is the sum of product penalties. In this work, the Simulated Annealing (SA) optimization algorithm was used to solve the scheduling problems. An alternative to SA was also developed based on a modification of the Rapid Access (RA) heuristics to obtain the initial sequence with the inclusion of penalty factors and due-dates. The performance of this method was compared to that of other heuristics. An algorithm that allows the inclusion of new orders for other products during the processing of a previously determined sequence of products was also developed.

KW - Batch Process

KW - Competitive Strategy

KW - Due-Date Penalty

KW - Heuristic Methods

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=0040688994&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0040688994&partnerID=8YFLogxK

M3 - Article

VL - 28

SP - 251

EP - 256

JO - Latin American Applied Research

JF - Latin American Applied Research

SN - 0327-0793

IS - 4

ER -