Matches in UGent Biblio for { <https://biblio.ugent.be/publication/5708913#aggregation> ?p ?o. }
Showing items 1 to 33 of
33
with 100 items per page.
- aggregation classification "A1".
- aggregation creator person.
- aggregation creator person.
- aggregation date "2014".
- aggregation format "application/pdf".
- aggregation hasFormat 5708913.bibtex.
- aggregation hasFormat 5708913.csv.
- aggregation hasFormat 5708913.dc.
- aggregation hasFormat 5708913.didl.
- aggregation hasFormat 5708913.doc.
- aggregation hasFormat 5708913.json.
- aggregation hasFormat 5708913.mets.
- aggregation hasFormat 5708913.mods.
- aggregation hasFormat 5708913.rdf.
- aggregation hasFormat 5708913.ris.
- aggregation hasFormat 5708913.txt.
- aggregation hasFormat 5708913.xls.
- aggregation hasFormat 5708913.yaml.
- aggregation isPartOf urn:issn:0020-7543.
- aggregation language "eng".
- aggregation rights "I have transferred the copyright for this publication to the publisher".
- aggregation subject "Business and Economics".
- aggregation title "Scheduling of unrelated parallel machines with limited server availability on multiple production locations: a case study in knitted fabrics".
- aggregation abstract "This paper studies a complex variation of the parallel machine scheduling (PMS) problem, as encountered at a Belgian producer of knitted fabrics. The aim is to assign N J jobs to N M unrelated parallel machines, minimising a weighted combination of job lateness and tardiness. Jobs are assigned specific release, and due dates and changeover times are sequence dependent. Current literature is extended by including geographically dispersed production locations, which influence job due dates and objective function coefficients. Furthermore, the changeover interference due to limited availability of technicians is also studied in this paper. The scheduling problem is solved using a hybrid meta-heuristic, which combines elements from simulated annealing and genetic algorithms. This hybrid meta-heuristic is capable of solving real-scale scheduling problems of up to 750 jobs, 75 machines and 10 production locations within reasonable computation time. This hybrid scheduling procedure is extended with heuristic dispatching rules capable of reducing the impact of changeover interference by 23% on average compared to the random scenario, for the case where a single technician is expected to serve up to 12 machines.".
- aggregation authorList BK1334082.
- aggregation endPage "2653".
- aggregation issue "9".
- aggregation startPage "2630".
- aggregation volume "52".
- aggregation aggregates 5708922.
- aggregation isDescribedBy 5708913.
- aggregation similarTo 00207543.2013.865855.
- aggregation similarTo LU-5708913.