Approximation algorithms for the min-max regret identical parallel machine scheduling problem with outsourcing and uncertain processing time
Shijin Wang and Wenli Cui
| Year of publication: |
2021
|
|---|---|
| Authors: | Wang, Shijin ; Cui, Wenli |
| Subject: | approximation algorithms | identical parallel machine scheduling | min-max regret | uncertainty | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Theorie | Theory | Outsourcing | Durchlaufzeit | Lead time | Branch-and-Bound | Branch and Bound | Entscheidung unter Unsicherheit | Decision under uncertainty |
Online Resource
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1080/00207543.2020.1766721 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012589336