Show simple item record

dc.contributor.authorMateo Doll, Manuel
dc.contributor.authorTeghem, Jacques
dc.contributor.authorTuyttens, Daniel
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament d'Organització d'Empreses
dc.date.accessioned2016-11-23T11:57:51Z
dc.date.available2016-11-23T11:57:51Z
dc.date.issued2016-01-01
dc.identifier.citationMateo, M., Teghem, J., Tuyttens, D. An algorithm for a bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs. "IFAC-PapersOnLine", 1 Gener 2016, vol. 49, núm. 12, p. 1614-1619.
dc.identifier.issn2405-8963
dc.identifier.urihttp://hdl.handle.net/2117/97109
dc.description.abstractThe scheduling of parallel machines is a well-known problem in many companies. Nevertheless, not always all the jobs can be manufactured in any machine and the eligibility appears. Based on a real-life problem, we present a model which has three different machines, called as high, medium and low level respectively. The set of jobs to be scheduled on these three parallel machines are also distributed among these three levels: one job from a level can be manufactured in a machine of the same or higher level. But a penalty appears when a job is manufactured in a machine different from the higher level. Besides, there are release dates and delivery times associated to each job. The tackled problem is bi-objective with the criteria: minimization of the final date-i.e. the maximum for all the jobs of their completion time plus the delivery time-and the minimization of the total penalty generated by the jobs. In a first step we revisited possible heuristics to minimize the final date on a single machine. In a second step a heuristic is proposed to approximate the set of efficient solutions and the Pareto front of the bi-objective problem. All the algorithms are experimented on various instances.
dc.format.extent6 p.
dc.language.isoeng
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Economia i organització d'empreses
dc.subject.lcshHeuristic algorithms
dc.subject.lcshProduction planning
dc.subject.otherscheduling
dc.subject.otherparallel machines
dc.subject.othereligibility
dc.subject.otherrelease dates
dc.subject.otherdelivery times
dc.subject.othermulti-objective optimization
dc.subject.otherPareto front
dc.titleAn algorithm for a bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs
dc.typeArticle
dc.subject.lemacProgramació heurística
dc.subject.lemacAlgorismes genètics
dc.subject.lemacProducció -- Planificació
dc.contributor.groupUniversitat Politècnica de Catalunya. EOLI - Enginyeria d'Organització i Logística Industrial
dc.identifier.doi10.1016/j.ifacol.2016.07.811
dc.description.peerreviewedPeer Reviewed
dc.relation.publisherversionhttp://www.sciencedirect.com/science/article/pii/S2405896316310941
dc.rights.accessOpen Access
local.identifier.drac19257123
dc.description.versionPostprint (published version)
local.citation.authorMateo, M.; Teghem, J.; Tuyttens, D.
local.citation.publicationNameIFAC-PapersOnLine
local.citation.volume49
local.citation.number12
local.citation.startingPage1614
local.citation.endingPage1619


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain