Please use this identifier to cite or link to this item: http://repositorio.inesctec.pt/handle/123456789/4478
Full metadata record
DC FieldValueLanguage
dc.contributor.authorSamuel Monizen
dc.contributor.authorBarbosa Povoa,APen
dc.contributor.authorJorge Pinho de Sousaen
dc.date.accessioned2017-12-20T15:28:24Z-
dc.date.available2017-12-20T15:28:24Z-
dc.date.issued2013en
dc.identifier.urihttp://repositorio.inesctec.pt/handle/123456789/4478-
dc.identifier.urihttp://dx.doi.org/10.1021/ie4021073en
dc.description.abstractThis work deals with the optimal short-term scheduling of general multipurpose batch plants, considering multiple operational characteristics such as sequence-dependent changeovers, temporary storage in the processing units, lots blending, and material flows traceability. A novel Mixed Integer Linear Programming (MILP) discrete-time formulation based on the State-Task Network (STN) is proposed, with new types of constraints for modeling changeovers and storage. We also propose some model extensions for addressing changeovers start; nonpreemptive lots; lots start and sizes; alternative task-unit and task-unit-layout assignments. Computational tests have shown that the proposed model is more effective than a similar model based on the Resource-Task Network (RTN).en
dc.languageengen
dc.relation4694en
dc.relation1201en
dc.rightsinfo:eu-repo/semantics/openAccessen
dc.titleNew General Discrete-Time Scheduling Model for Multipurpose Batch Plantsen
dc.typearticleen
dc.typePublicationen
Appears in Collections:CESE - Other Publications

Files in This Item:
File Description SizeFormat 
P-006-J6A.pdf2.84 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.