Pages that link to "Item:Q867431"

The following pages link to An algorithm for the job shop scheduling problem based on global equilibrium search techniques (Q867431):

Displaying 10 items.

• A tabu search/path relinking algorithm to solve the job shop scheduling problem (Q337272) (← links)
• MILP-based approaches for medium-term planning of single-stage continuous multiproduct plants with parallel units (Q601970) (← links)
• Solving job shop scheduling problems utilizing the properties of backbone and ``big valley'' (Q707768) (← links)
• A review of recent advances in global optimization (Q842710) (← links)
• An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times (Q968014) (← links)
• Kernel technology to solve discrete optimization problems (Q1699399) (← links)
• A priority-based genetic algorithm for a flexible job shop scheduling problem (Q2358304) (← links)
• Optimizing makespan and stability risks in job shop scheduling (Q2664315) (← links)
• A new hybrid parallel genetic algorithm for the job‐shop scheduling problem (Q4980005) (← links)
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)