Pages that link to "Item:Q4025904"
From MaRDI portal
The following pages link to A Computational Study of the Job-Shop Scheduling Problem (Q4025904):
Displaying 50 items.
- JOBSHOP (Q16969) (← links)
- Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm (Q260652) (← links)
- Dynamic resource allocation: a flexible and tractable modeling framework (Q299823) (← links)
- Configuration and the advantages of the shifting bottleneck procedure for optimizing the job shop total weighted tardiness scheduling problem (Q309064) (← links)
- A tabu search/path relinking algorithm to solve the job shop scheduling problem (Q337272) (← links)
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- An effective new island model genetic algorithm for job shop scheduling problem (Q342266) (← links)
- Mixed integer programming models for job shop scheduling: A computational analysis (Q342439) (← links)
- Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
- Project scheduling with flexible resources: formulation and inequalities (Q443821) (← links)
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- Scheduling and constraint propagation (Q697570) (← links)
- Event-based MILP models for resource-constrained project scheduling problems (Q709100) (← links)
- Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← links)
- Principles for the design of large neighborhood search (Q846169) (← links)
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques (Q867431) (← links)
- Arc-B-consistency of the inter-distance constraint (Q879973) (← links)
- Minimizing total weighted tardiness in a generalized job shop (Q880516) (← links)
- Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
- Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
- A filter-and-fan approach to the job shop scheduling problem (Q958547) (← links)
- Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times (Q964844) (← links)
- A new neighborhood and tabu search for the blocking job shop (Q967433) (← links)
- A heuristic for scheduling general job shops to minimize maximum lateness (Q969764) (← links)
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← links)
- Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
- Complete local search with limited memory algorithm for no-wait job shops to minimize makespan (Q1026757) (← links)
- Minimum formwork stock problem on residential buildings construction sites (Q1041411) (← links)
- An integrated tabu search algorithm for the lot streaming problem in job shops (Q1042155) (← links)
- Extending the shifting bottleneck procedure to real-life applications (Q1266541) (← links)
- A neural network model for scheduling problems (Q1268160) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- The generalized shifting bottleneck procedure (Q1268190) (← links)
- Price-based planning and scheduling of multiproduct orders in symbiotic manufacturing networks (Q1278475) (← links)
- Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
- Benchmarks for shop scheduling problems (Q1296703) (← links)
- Cellular control of manufacturing systems (Q1309976) (← links)
- Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
- A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
- The job-shop problem and immediate selection (Q1339120) (← links)
- A genetic algorithm for the job shop problem (Q1342314) (← links)
- Evolution based learning in a job shop scheduling environment (Q1342315) (← links)
- Effective job shop scheduling through active chain manipulation (Q1342330) (← links)
- Job-shop scheduling: Computational study of local search and large-step optimization methods (Q1388829) (← links)
- Approximative procedures for no-wait job shop scheduling. (Q1413924) (← links)
- Decomposition methods for reentrant flow shops with sequence-dependent setup times (Q1579123) (← links)
- Constraint propagation techniques for the disjunctive scheduling problem (Q1583518) (← links)
- On not-first/not-last conditions in disjunctive scheduling (Q1590039) (← links)
