A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling Problem

by Christoforos Charalambous, Krzysztof Fleszar, Khalil S. Hindi

Published in IFIP Advances in Information and Communication Technology by Springer Berlin Heidelberg.

2010 p230-237

application/pdf 582.5 kB `file_bvtnulhe5bhg3fvvp27sdprxam`	hal.inria.fr (repository) web.archive.org (webarchive)
application/pdf 250.4 kB `file_k6mjug7zzfgkrajbhzyrbbmm7u`	dl.ifip.org (web) web.archive.org (webarchive)
application/pdf 144.8 kB `file_rj5ijz5u5zhdrcyfkt5nswds7y`	web.archive.org (webarchive) link.springer.com (publisher)

Preserved and Accessible

Type chapter
Stage

published

Year 2010

DOI 10.1007/978-3-642-16239-8_31

Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L: 1868-4238

Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)

Cite This

BibTeX
CSL-JSON
MLA
Harvard

Lookup Links

Catalog Record
Revision: 1b8d5874-cc55-4c34-b9bb-c689410672d9
API URL: JSON

A Hybrid Searching Method for the Unrelated Parallel Machine Scheduling Problem release_cfflrktigvaxlg7wel73rrx7ya