Pages that link to "Item:Q5932283"

The following pages link to Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283):

Displaying 11 items.

• Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
• Scheduling and constraint propagation (Q697570) (← links)
• Local adjustments: A general algorithm (Q707084) (← links)
• A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
• New single machine and job-shop scheduling problems with availability constraints (Q880500) (← links)
• Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
• Theoretical expectation versus practical performance of Jackson's heuristic (Q1665791) (← links)
• The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
• An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
• Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091) (← links)
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)