An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines
An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines
About this item
Full title
Author / Creator
Publisher
Hoboken, USA: John Wiley & Sons, Inc
Journal title
Language
English
Formats
Publication information
Publisher
Hoboken, USA: John Wiley & Sons, Inc
Subjects
More information
Scope and Contents
Contents
We consider the multitasking scheduling problem on unrelated parallel machines to minimize the total weighted completion time. In this problem, each machine processes a set of jobs, while the processing of a selected job on a machine may be interrupted by other available jobs scheduled on the same machine but unfinished. To solve this problem, we p...
Alternative Titles
Full title
An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2269247077
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2269247077
Other Identifiers
ISSN
0894-069X
E-ISSN
1520-6750
DOI
10.1002/nav.21863
