Pages that link to "Item:Q852941"
From MaRDI portal
The following pages link to Necessary and sufficient conditions of optimality for some classical scheduling problems (Q852941):
Displaying 14 items.
- Lawler's minmax cost algorithm: optimality conditions and uncertainty (Q309059) (← links)
- Inverse scheduling: Two-machine flow-shop problem (Q640308) (← links)
- Optimality conditions for weak efficiency to vector optimization problems with composed convex functions (Q944049) (← links)
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines (Q1038367) (← links)
- Inverse scheduling with maximum lateness objective (Q1041341) (← links)
- Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines (Q1702729) (← links)
- Minimizing the number of late jobs when the start time of the machine is variable (Q1758276) (← links)
- On scheduling a deteriorating rate-modifying activity to minimize the number of tardy jobs (Q2176833) (← links)
- On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty (Q2215204) (← links)
- Scheduling to tradeoff between the number and the length of accepted jobs (Q2235744) (← links)
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
- The dominance digraph as a solution to the two-machine flow-shop problem with interval processing times (Q3111147) (← links)
- TWO-MACHINE FLOW-SHOP MINIMUM-LENGTH SCHEDULING WITH INTERVAL PROCESSING TIMES (Q3406723) (← links)
- Single machine adversarial bilevel scheduling problems (Q6554600) (← links)
