Pages that link to "Item:Q1293191"

The following pages link to A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191):

Displaying 13 items.

• Scatter search with path relinking for the job shop with time lags and setup times (Q337556) (← links)
• Production scheduling with alternative process plans (Q439374) (← links)
• Time symmetry of resource constrained project scheduling with general temporal constraints and take-give resources (Q513559) (← links)
• A branch and bound algorithm for the one-machine scheduling problem with minimum and maximum time lags (Q872246) (← links)
• Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems (Q1590040) (← links)
• Minimizing flowtime for paired tasks (Q1751895) (← links)
• Weight-based heuristics for constraint satisfaction and combinatorial optimization problems (Q1951176) (← links)
• Improved formulations and new valid inequalities for a hybrid flow shop problem with time-varying resources and chaining time-lag (Q2108105) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• Minimum equivalent precedence relation systems (Q2410264) (← links)
• A memetic algorithm for the job-shop with time-lags (Q2468490) (← links)
• An Optimal Constraint Programming Approach to the Open-Shop Problem (Q2815442) (← links)
• (Q2861494) (← links)