Pages that link to "Item:Q3778528"

The following pages link to The Shifting Bottleneck Procedure for Job Shop Scheduling (Q3778528):

Displaying 50 items.

• A scheduling problem in the baking industry (Q2336885) (← links)
• On mathematical programming with indicator constraints (Q2349121) (← links)
• A multi-objective memetic algorithm for the job-shop scheduling problem (Q2359531) (← links)
• A new lower bound for the job-shop scheduling problem (Q2366077) (← links)
• A tabu search experience in production scheduling (Q2366998) (← links)
• Routing and scheduling in a flexible job shop by tabu search (Q2366999) (← links)
• Applying tabu search to the job-shop scheduling problem (Q2367003) (← links)
• Particle swarm optimization combined with genetic operators for job shop scheduling problem with fuzzy processing time (Q2378748) (← links)
• A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605) (← links)
• Optimal job insertion in the no-wait job shop (Q2392741) (← links)
• Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports (Q2398778) (← links)
• An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem (Q2411179) (← links)
• A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem (Q2427185) (← links)
• Integrated production and material handling scheduling using mathematical programming and constraint programming (Q2433554) (← links)
• A linear programming-based method for job shop scheduling (Q2434310) (← links)
• An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
• A prediction based iterative decomposition algorithm for scheduling large-scale job shops (Q2473277) (← links)
• A hybrid genetic algorithm for the job shop scheduling problem (Q2484343) (← links)
• Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches (Q2485332) (← links)
• Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
• Single machine scheduling subject to precedence delays (Q2563923) (← links)
• Modelling and heuristics of FMS scheduling with multiple objectives (Q2566932) (← links)
• Applying machine based decomposition in 2-machine flow shops (Q2572846) (← links)
• Job-shop local-search move evaluation without direct consideration of the criterion's value (Q2629670) (← links)
• A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times (Q2668670) (← links)
• Semiconductor final-test scheduling under setup operator constraints (Q2669721) (← links)
• Instance space analysis and algorithm selection for the job shop scheduling problem (Q2669728) (← links)
• An algorithm selection approach for the flexible job shop scheduling problem: choosing constraint programming solvers through machine learning (Q2672113) (← links)
• Sensitivity analysis for bottleneck assignment problems (Q2673565) (← links)
• Enhancing CLP branch and bound techniques for scheduling problems (Q2721220) (← links)
• Guided local search with shifting bottleneck for job shop scheduling (Q2783788) (← links)
• Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems (Q2792203) (← links)
• Real time production improvement through bottleneck control (Q3055276) (← links)
• Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278) (← links)
• A scatter search approach to sequence-dependent setup times job shop scheduling (Q3055324) (← links)
• The application of genetic algorithms to lot streaming in a job-shop scheduling problem (Q3055438) (← links)
• Multi-agent based beam search for intelligent production planning and scheduling (Q3163302) (← links)
• Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search (Q3466772) (← links)
• Study on constraint scheduling algorithm for job shop problems with multiple constraint machines (Q3527958) (← links)
• Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study (Q3605414) (← links)
• Scheduling the General Job-Shop (Q3750501) (← links)
• A Computational Study of the Job-Shop Scheduling Problem (Q4025904) (← links)
• Part-mix allocation in a hybrid manufacturing system with a flexible manufacturing cell and a conventional jobshop (Q4230150) (← links)
• Scheduling larger job shops: a decomposition approach (Q4230201) (← links)
• Formulation and solution of the drum-buffer-rope constraint scheduling problem ( DBRCSP) (Q4230239) (← links)
• (Q4238569) (← links)
• A genetic algorithm methodology for complex scheduling problems (Q4239710) (← links)
• Improving job-shop schedules through critical pairwise exchanges (Q4245535) (← links)
• A dynamic job shop scheduling framework: a backward approach (Q4394248) (← links)
• Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times (Q4394265) (← links)