Skip to main content

1988 | OriginalPaper | Buchkapitel

Minimizing Makespan on Unrelated Parallel Machine

verfasst von : S. L. van de Velde

Erschienen in: DGOR/NSOR

Verlag: Springer Berlin Heidelberg

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

There are m parallel machines available for processing n independent jobs. A machine can process one job at a time and a job, once started, has to be finished without preemption. Processing job j on machine i requires time P ij . The objective is to find a schedule of minimum length.

Metadaten
Titel
Minimizing Makespan on Unrelated Parallel Machine
verfasst von
S. L. van de Velde
Copyright-Jahr
1988
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-73778-7_170