Pages that link to "Item:Q3778528"

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

Displaying 50 items.

• Augmented neural networks for task scheduling. (Q1410307) (← links)
• Job-shop scheduling with processing alternatives. (Q1410614) (← links)
• An experimental analysis of local minima to improve neighbourhood search. (Q1422374) (← links)
• An efficient genetic algorithm for job shop scheduling with tardiness objectives. (Q1427583) (← links)
• Heuristics for minimizing total weighted tardiness in flexible flow shops (Q1567299) (← links)
• A hybrid genetic algorithm for the open shop scheduling problem (Q1576331) (← links)
• Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
• Efficiency of reductions of job-shop to flow-shop problems (Q1582031) (← links)
• Decomposition methods for large job shops (Q1592580) (← links)
• Concurrent operations can be parallelized in scheduling multiprocessor job shop (Q1607976) (← links)
• A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops (Q1607977) (← links)
• Minimizing makespan on parallel machines subject to release dates and delivery times (Q1607981) (← links)
• A tabu search approach to machine scheduling (Q1609892) (← links)
• An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
• A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem (Q1652506) (← links)
• Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems (Q1665003) (← links)
• A batch-oblivious approach for complex job-shop scheduling problems (Q1695012) (← links)
• Extended GRASP for the job shop scheduling problem with total weighted tardiness objective (Q1753631) (← links)
• The job shop scheduling problem with convex costs (Q1754305) (← links)
• Rule-based scheduling in wafer fabrication with due date-based objectives (Q1761232) (← links)
• A competent memetic algorithm for complex scheduling (Q1761722) (← links)
• Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← links)
• Project scheduling under uncertainty: survey and research potentials (Q1772834) (← links)
• Maximization of solution flexibility for robust shop scheduling (Q1772837) (← links)
• Optimal timing of a sequence of tasks with general completion costs (Q1776957) (← links)
• Insertion techniques for the heuristic solution of the job shop problem (Q1805458) (← links)
• Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
• Job shop scheduling with beam search (Q1806850) (← links)
• Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
• A lower bound for the job insertion problem. (Q1811122) (← links)
• An extended enterprise planning methodology for the discrete manufacturing industry (Q1840855) (← links)
• Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
• On the drift of short schedules. (Q1853539) (← links)
• An improved shifting bottleneck procedure for the job shop scheduling problem (Q1879795) (← links)
• A novel threshold accepting meta-heuristic for the job-shop scheduling problem (Q1885997) (← links)
• Adaptive temperature control for simulated annealing: a comparative study (Q1886508) (← links)
• Executing production schedules in the face of uncertainties: a review and some future directions (Q1887777) (← links)
• Reducing simulation models for scheduling manufacturing facilities (Q1887780) (← links)
• An improved tabu search approach for solving the job shop scheduling problem with tooling constraints (Q1917279) (← links)
• A sequencing problem with family setup times (Q1917311) (← links)
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357) (← links)
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem (Q1969832) (← links)
• Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics (Q1978312) (← links)
• A survey of scheduling with parallel batch (p-batch) processing (Q2076906) (← links)
• A simulated multi-objective model for flexible job shop transportation scheduling (Q2150761) (← links)
• Efficient primal heuristic updates for the blocking job shop problem (Q2239845) (← links)
• Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
• A theoretic and practical framework for scheduling in a stochastic environment (Q2268505) (← links)
• Nested partitions for the large-scale extended job shop scheduling problem (Q2271832) (← links)
• The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)