Show simple item record

Combining global pruning rules with depth-first search for the job shop scheduling problem with operators

dc.contributor.authorMencía Cascallana, Carlos 
dc.contributor.authorSierra Sánchez, María Rita 
dc.contributor.authorSalido, Miguel A.
dc.contributor.authorEscamilla, Joan
dc.contributor.authorVarela Arias, José Ramiro 
dc.date.accessioned2015-12-11T11:25:18Z
dc.date.available2015-12-11T11:25:18Z
dc.date.issued2012-06
dc.identifier.urihttp://hdl.handle.net/10651/34010
dc.description.abstractWe propose an enhanced depth- rst heuristic search algorithm to face the job shop scheduling problem with operators. This problem extends the classical job shop scheduling problem by considering a limited number of human operators that assist the processing of the operations. We considered total ow time minimization as objective function which makes the problem harder to solve and more interesting from a practical point of view than minimizing the makespan. The proposed method exploits a schedule generation scheme termed OG&T, two admissible heuristics and some powerful global pruning rules that require recording expanded states. We have conducted an experimental study across several benchmarks to evaluate our algorithm. The results show that the global pruning method is really e ective and that the proposed approach is quite competent for solving this problemspa
dc.description.sponsorshipThis research has been supported by the Spanish Government under projects MEC-FEDER TIN-20976-C02-01 and TIN-20976-C02-02 and by the Principality of Asturias under grant FICYT-BP09105spa
dc.language.isoengspa
dc.relation.ispartof19th RCRA International Workshop on "Experimental Evaluation of Algorithms for solving problems with combinatorial explosion”, RCRA 2012spa
dc.rightsCC Reconocimiento - No comercial - Sin obras derivadas 4.0 Internacional
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/
dc.titleCombining global pruning rules with depth-first search for the job shop scheduling problem with operatorsspa
dc.typeinfo:eu-repo/semantics/conferenceObjectspa
dc.type.dcmitextspa
dc.relation.projectIDMEC-FEDER/TIN-20976-C02-01spa
dc.relation.projectIDMEC-FEDER/TIN-20976-C02-02
dc.relation.projectIDFICYT/BP09105
dc.rights.accessRightsinfo:eu-repo/semantics/openAccessspa


Files in this item

untranslated

This item appears in the following Collection(s)

Show simple item record

CC Reconocimiento - No comercial - Sin obras derivadas 4.0 Internacional
This item is protected with a Creative Commons License