Pages that link to "Item:Q1811122"

The following pages link to A lower bound for the job insertion problem. (Q1811122):

Displaying 9 items.

• Feasible insertions in job shop scheduling, short cycles and stable sets (Q856271) (← links)
• Analysis of reactive deadlock-free scheduling in flexible job shops (Q1028658) (← links)
• The resource-constrained activity insertion problem with minimum and maximum time lags (Q1041351) (← links)
• A branch and bound algorithm and iterative reordering strategies for inserting additional trains in real time: a case study in Germany (Q1665246) (← links)
• Efficient primal heuristic updates for the blocking job shop problem (Q2239845) (← links)
• Optimal job insertion in the no-wait job shop (Q2392741) (← links)
• Feasible job insertions in the multi-processor-task job shop (Q2464217) (← links)
• Complexity of the job insertion problem in multi-stage scheduling (Q2467449) (← links)
• Proactive, dynamic and multi-criteria scheduling of maintenance activities (Q3055649) (← links)