Pages that link to "Item:Q5538322"

The following pages link to A Branch-Bound Solution to the General Scheduling Problem (Q5538322):

Displayed 11 items.

• Timetabling optimization of a single railway track line with sensitivity analysis (Q845568) ‎ (← links)
• A mixed integer program for loading and scheduling multiple flexible manufacturing cells (Q1082246) ‎ (← links)
• Multiple and bicriteria scheduling: A literature survey (Q1130028) ‎ (← links)
• Integer programming formulation of combinatorial optimization problems (Q1239086) ‎ (← links)
• A unified formulation of the machine scheduling problem (Q1245650) ‎ (← links)
• The job shop scheduling problem: Conventional and new solution techniques (Q1268188) ‎ (← links)
• The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure. (Q1410335) ‎ (← links)
• Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure (Q1600885) ‎ (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) ‎ (← links)
• Bicriteria train scheduling for high-speed passenger railroad planning applications (Q2566708) ‎ (← links)
• Dynamical Neural Network Approach to the Job-shop Scheduling (Q4846554) ‎ (← links)