Parallel machine scheduling under uncertainty

DOI10.1007/978-3-642-31724-8_9MaRDI QIDQ3143637zbMATH OpenOpenAlexFDO

Authors Adam Kasperski, Adam Kurpisz, Paweł Zieliński

Publication date 3 December 2012

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31724-8_9

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single machine scheduling problems with uncertain parameters and the OWA criterion
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
• A robust identical parallel machine scheduling model based on min-max regret criterion
• A new model and algorithm for uncertain random parallel machine scheduling problem
• Risk averse scheduling with scenarios

Cited in

(23)

• Minimizing worst-case and average-case makespan over scenarios
• Distributionally robust scheduling on parallel machines under moment uncertainty
• Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
• An approximation scheme for the bi-scenario sum of completion times trade-off problem
• A new model and algorithm for uncertain random parallel machine scheduling problem
• Bin packing problem with scenarios
• A MIP formulation for the minmax regret total completion time in scheduling with unrelated parallel machines
• Scheduling jobs with uncertain parameters: analysis of research directions
• scientific article; zbMATH DE number 1539053 (Why is no real title available?)
• scientific article; zbMATH DE number 947476 (Why is no real title available?)
• Parallel Machine Scheduling with Uncertain Communication Delays
• A robust identical parallel machine scheduling model based on min-max regret criterion
• Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
• Approximation results for makespan minimization with budgeted uncertainty
• A state-of-the-art survey on multi-scenario scheduling
• Total completion time scheduling under scenarios
• Single-machine makespan scheduling with scenario-dependent release dates
• Total completion time scheduling under scenarios
• Min-max relative regret for scheduling to minimize maximum lateness
• Minimizing total completion time and makespan for a multi-scenario bi-criteria parallel machine scheduling problem
• Robust allocation of operating rooms: a cutting plane approach to handle lognormal case durations
• Online makespan minimization with budgeted uncertainty
• Sensitivity bounds for machine scheduling with uncertain communication delays

This page was built for publication: Parallel machine scheduling under uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143637)