Permutation Flowshop Scheduling with Earliness and Tardiness Penalties

Tirupati Devanath, Peeyush Mehta and Pankaj Chandra

No WP2004-07-06, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: We address the permutation flowshop scheduling problem with earliness and tardiness penalties (E/T) and common due date of jobs. Large number of process and discrete parts industries follow flowshop type of production process. There are very few results reported for multi-machine E/T scheduling problems. We show that the problem can be sub-divided into three groups- one, where the due date is such that all jobs are necessarily tardy; the second, where the due date is such that it is not tight enough to act as a constraint on scheduling decision; and the third is a group of problems where the due date is in between the above two. We develop analytical results and heuristics for problems arising in each of these three classes. Computational results of the heuristics are reported. Most of the problems in this research are addressed for the first time in the literature. For problems with existing heuristics, the heuristic solution is found to perform better than the existing results.

Date: 2004-07-06
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.iima.ac.in/sites/default/files/rnpfiles/2004-07-06pankajchandra.pdf English Version (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iim:iimawp:wp01838

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().