Pages that link to "Item:Q657256"

The following pages link to Minimizing the number of late jobs on a single machine under due date uncertainty (Q657256):

Displaying 15 items.

• Single machine scheduling problems with uncertain parameters and the OWA criterion (Q282249) (← links)
• Lawler's minmax cost algorithm: optimality conditions and uncertainty (Q309059) (← links)
• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← links)
• Scenario based robust line balancing: Computational complexity (Q442208) (← links)
• Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration (Q741381) (← links)
• A robust two-machine flow-shop scheduling model with scenario-dependent processing times (Q782088) (← links)
• Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty (Q1652531) (← links)
• Min-max and min-max (relative) regret approaches to representatives selection problem (Q1936659) (← links)
• Parameterized multi-scenario single-machine scheduling problems (Q2196612) (← links)
• Risk-averse single machine scheduling: complexity and approximation (Q2286434) (← links)
• Lawler's minmax cost problem under uncertainty (Q2410026) (← links)
• Complexity results for common due date scheduling problems with interval data and minmax regret criterion (Q2422739) (← links)
• Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion (Q2806942) (← links)
• JUST-IN-TIME SCHEDULING UNDER SCENARIO-BASED UNCERTAINTY (Q2836525) (← links)
• A state-of-the-art survey on multi-scenario scheduling (Q6113303) (← links)