Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/442
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChandra, Pankaj-
dc.contributor.authorMehta, Peeyush-
dc.contributor.authorTirupati, Devanath-
dc.date.accessioned2009-09-02T06:36:40Z-
dc.date.available2009-09-02T06:36:40Z-
dc.date.copyright2004-07-
dc.date.issued2009-09-02T06:36:40Z-
dc.identifier.urihttp://hdl.handle.net/11718/442-
dc.description.abstractWe 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.en
dc.language.isoenen
dc.relation.ispartofseriesWP;2004-07-06-
dc.subjectflowshopen
dc.subjectearlinessen
dc.subjecttardinessen
dc.subjectcommon due dateen
dc.titlePermutation Flowshop Scheduling with Earliness and Tardiness Penaltiesen
dc.typeWorking Paperen
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
2004-07-06pankajchandra.pdf272.37 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.