Pages that link to "Item:Q1327223"

The following pages link to A branch and bound algorithm for the job-shop scheduling problem (Q1327223):

Displaying 26 items.

• Applying tabu search to the job-shop scheduling problem (Q2367003) (← links)
• A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
• No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
• A hybrid genetic algorithm for the job shop scheduling problem (Q2484343) (← links)
• An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
• Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem (Q2569091) (← links)
• Applying machine based decomposition in 2-machine flow shops (Q2572846) (← links)
• (Q2861532) (← links)
• A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems (Q2943496) (← links)
• Immersed NURBS for CFD Applications (Q2948918) (← links)
• Study on constraint scheduling algorithm for job shop problems with multiple constraint machines (Q3527958) (← links)
• Mixed multigraph approach to scheduling jobs on machines of different types^∗ (Q4375439) (← links)
• Alternative graph formulation for solving complex factory-scheduling problems (Q4415989) (← links)
• Measures of subproblem criticality in decomposition algorithms for shop scheduling (Q4460042) (← links)
• A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
• A new approach to computing optimal schedules for the job-shop scheduling problem (Q4645937) (← links)
• A new hybrid parallel genetic algorithm for the job‐shop scheduling problem (Q4980005) (← links)
• Evaluating topological ordering in directed acyclic graphs (Q5061711) (← links)
• Evaluation of a new decision-aid parameter for job shop scheduling under uncertainties (Q5242361) (← links)
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling (Q5416771) (← links)
• Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283) (← links)
• Solving the open shop scheduling problem (Q5939272) (← links)
• Local search algorithms for a single-machine scheduling problem with positive and negative time-lags (Q5946822) (← links)
• Novel model and solution method for flexible job shop scheduling problem with batch processing machines (Q6065642) (← links)
• An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents (Q6087487) (← links)
• Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)