Min–max regret-based robust makespan minimization of the unrelated parallel batch processing machine scheduling problem with uncertain processing time

Ji, B; Xiao, X; Yu, Samson; Zhang, D

Min–max regret-based robust makespan minimization of the unrelated parallel batch processing machine scheduling problem with uncertain processing time

https://hdl.handle.net/10779/DRO/DU:29905913

journal contribution

posted on 2025-08-15, 05:43 authored by B Ji, X Xiao, Samson YuSamson Yu, D Zhang

Min–max regret-based robust makespan minimization of the unrelated parallel batch processing machine scheduling problem with uncertain processing time

History

Related Materials

1.
DOI - Is version of https://doi.org/10.1080/0305215X.2025.2527731

Location

London, Eng.

Language

eng

Publication classification

C1 Refereed article in a scholarly journal

Journal

Engineering Optimization

Volume

ahead-of-print

Pagination

1-21

ISSN

0305-215X

eISSN

1029-0273

Issue

ahead-of-print

Publisher

Taylor and Francis Group

Usage metrics

Keywords

Uncategorised value

Min–max regret-based robust makespan minimization of the unrelated parallel batch processing machine scheduling problem with uncertain processing time

History

Related Materials

Location

Language

Publication classification

Journal

Volume

Pagination

ISSN

eISSN

Issue

Publisher

Usage metrics

Categories

Keywords

Licence

Exports