Pages that link to "Item:Q1600885"

The following pages link to Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure (Q1600885):

Displaying 9 items.

• Operating room scheduling with generalized disjunctive programming (Q342094) (← links)
• Finding the shortest path with honey-bee mating optimization algorithm in project management problems with constrained/unconstrained resources (Q707776) (← links)
• MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry (Q992661) (← links)
• An experimental analysis of solution performance in a resource sharing and scheduling problem (Q1776960) (← links)
• An efficient MILP-based decomposition strategy for solving large-scale scheduling problems in the shipbuilding industry (Q2302367) (← links)
• A hybrid method for large-scale short-term scheduling of make-and-pack production processes (Q2356282) (← links)
• Integer programming approach to reactive scheduling in make-to-order manufacturing (Q2473247) (← links)
• Scheduling of road vehicles in sugarcane transport: a case study at an Australian sugar mill (Q2575581) (← links)
• A discrete time reactive scheduling model for new order insertion in job shop, make-to-order industries (Q3168937) (← links)