Pages that link to "Item:Q852941"

The following pages link to Necessary and sufficient conditions of optimality for some classical scheduling problems (Q852941):

Displaying 7 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)