Tabu search and lower bounds for a combined production-transportation problem
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Condotta, Alessandro | |
dc.contributor.author | Knust, Sigrid | |
dc.contributor.author | Meier, Dimitri | |
dc.contributor.author | Shakhlevich, Natalia V. | |
dc.date.accessioned | 2021-12-23T16:09:00Z | - |
dc.date.available | 2021-12-23T16:09:00Z | - |
dc.date.issued | 2013 | |
dc.identifier.issn | 03050548 | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/8567 | - |
dc.description.abstract | In this paper we consider a combined production-transportation problem, where n jobs have to be processed on a single machine at a production site before they are delivered to a customer. At the production stage, for each job a release date is given; at the transportation stage, job delivery should be completed not later than a given due date. The transportation is done by m identical vehicles with limited capacity. It takes a constant time to deliver a batch of jobs to the customer. The objective is to find a feasible schedule minimizing the maximum lateness. After formulating the considered problem as a mixed integer linear program, we propose different methods to calculate lower bounds. Then we describe a tabu search algorithm which enumerates promising partial solutions for the production stage. Each partial solution is complemented with an optimal transportation schedule (calculated in polynomial time) achieving a coordinated solution to the combined production-transportation problem. Finally, we present results of computational experiments on randomly generated data. (C) 2012 Elsevier Ltd. All rights reserved. | |
dc.description.sponsorship | EPSRCUK Research & Innovation (UKRI)Engineering & Physical Sciences Research Council (EPSRC) [EP/K041274/1] Funding Source: UKRI | |
dc.language.iso | en | |
dc.publisher | PERGAMON-ELSEVIER SCIENCE LTD | |
dc.relation.ispartof | COMPUTERS & OPERATIONS RESEARCH | |
dc.subject | ALGORITHM | |
dc.subject | BATCH | |
dc.subject | Batching | |
dc.subject | Computer Science | |
dc.subject | Computer Science, Interdisciplinary Applications | |
dc.subject | DELIVERY | |
dc.subject | Engineering | |
dc.subject | Engineering, Industrial | |
dc.subject | FLOW-SHOP | |
dc.subject | JOBS | |
dc.subject | Lower bounds | |
dc.subject | MACHINES | |
dc.subject | MINIMIZING MAKESPAN | |
dc.subject | NEIGHBORHOOD SEARCH | |
dc.subject | Operations Research & Management Science | |
dc.subject | RELEASE | |
dc.subject | Scheduling | |
dc.subject | Tabu search | |
dc.subject | Transportation | |
dc.title | Tabu search and lower bounds for a combined production-transportation problem | |
dc.type | journal article | |
dc.identifier.doi | 10.1016/j.cor.2012.08.017 | |
dc.identifier.isi | ISI:000312420100022 | |
dc.description.volume | 40 | |
dc.description.issue | 3 | |
dc.description.startpage | 886 | |
dc.description.endpage | 900 | |
dc.contributor.orcid | 0000-0002-5225-4008 | |
dc.identifier.eissn | 1873765X | |
dc.publisher.place | THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND | |
dcterms.isPartOf.abbreviation | Comput. Oper. Res. | |
dcterms.oaStatus | Green Accepted | |
crisitem.author.dept | FB 06 - Mathematik/Informatik | - |
crisitem.author.dept | Universität Osnabrück | - |
crisitem.author.deptid | fb06 | - |
crisitem.author.orcid | 0000-0002-5225-4008 | - |
crisitem.author.parentorg | Universität Osnabrück | - |
crisitem.author.netid | KnSi808 | - |
crisitem.author.netid | ShNa001 | - |
Seitenaufrufe
6
Letzte Woche
0
0
Letzter Monat
1
1
geprüft am 20.05.2024