Complexity results for flow-shop and open-shop scheduling problems with transportation delays
DC Element | Wert | Sprache |
---|---|---|
dc.contributor.author | Brucker, P | |
dc.contributor.author | Knust, S | |
dc.contributor.author | Cheng, TCE | |
dc.contributor.author | Shakhlevich, NV | |
dc.date.accessioned | 2021-12-23T16:16:27Z | - |
dc.date.available | 2021-12-23T16:16:27Z | - |
dc.date.issued | 2004 | |
dc.identifier.issn | 02545330 | |
dc.identifier.uri | https://osnascholar.ub.uni-osnabrueck.de/handle/unios/11883 | - |
dc.description | Biennial Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), Aussois, FRANCE, JUN 17-22, 2001 | |
dc.description.abstract | We consider shop problems with transportation delays where not only the jobs on the machines have to be scheduled, but also transportation of the jobs between the machines has to be taken into account. Jobs consisting of a given number of operations have to be processed on machines in such a way that each machine processes at most one operation at a time and a job is not processed by more than one machine simultaneously. Transportation delays occur if a job changes from one machine to another. The objective is to find a feasible schedule which minimizes some objective function. A survey of known complexity results for flow-shop and open-shop environments is given and some new complexity results are derived. | |
dc.language.iso | en | |
dc.publisher | SPRINGER | |
dc.relation.ispartof | ANNALS OF OPERATIONS RESEARCH | |
dc.subject | 2 MACHINES | |
dc.subject | 2-MACHINE OPEN-SHOP | |
dc.subject | complexity results | |
dc.subject | Operations Research & Management Science | |
dc.subject | scheduling | |
dc.subject | shop problems | |
dc.subject | TIME LAGS | |
dc.subject | time-lags | |
dc.subject | transportation delays | |
dc.title | Complexity results for flow-shop and open-shop scheduling problems with transportation delays | |
dc.type | conference paper | |
dc.identifier.doi | 10.1023/B:ANOR.0000030683.64615.c8 | |
dc.identifier.isi | ISI:000221882100006 | |
dc.description.volume | 129 | |
dc.description.issue | 1-4 | |
dc.description.startpage | 81 | |
dc.description.endpage | 106 | |
dc.contributor.orcid | 0000-0001-5127-6419 | |
dc.contributor.orcid | 0000-0002-5225-4008 | |
dc.contributor.researcherid | D-5688-2015 | |
dc.identifier.eissn | 15729338 | |
dc.publisher.place | VAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS | |
dcterms.isPartOf.abbreviation | Ann. Oper. Res. | |
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
5
Letzte Woche
0
0
Letzter Monat
3
3
geprüft am 02.06.2024