The following pages link to JOBSHOP (Q16969):
Displayed 50 items.
- 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)
- 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)
- Approximation algorithms for multiprocessor scheduling under uncertainty (Q613111) (← links)
- Scheduling and constraint propagation (Q697570) (← links)
- LSSPER: Solving the resource-constrained project scheduling problem with large neighbourhood search (Q702729) (← links)
- An ant colony optimization algorithm for shop scheduling problems (Q702768) (← links)
- Local search genetic algorithms for the job shop scheduling problem (Q702800) (← links)
- Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← links)
- Principles for the design of large neighborhood search (Q846169) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- Arc-B-consistency of the inter-distance constraint (Q879973) (← 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 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)
- 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)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← 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)
- 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)
- Applying constraint satisfaction techniques to job shop scheduling (Q1374445) (← 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)
- On not-first/not-last conditions in disjunctive scheduling (Q1590039) (← links)
- Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure (Q1600885) (← links)
- Local search with constraint propagation and conflict-based heuristics (Q1606115) (← links)
- Hybrid genetic algorithm with multiparents crossover for job shop scheduling problems (Q1665003) (← links)
- A competent memetic algorithm for complex scheduling (Q1761722) (← links)
- Large neighbourhood search algorithms for the founder sequence reconstruction problem (Q1761968) (← links)
- Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Job-shop scheduling with blocking and no-wait constraints (Q1848398) (← links)
- Optimization software class libraries (Q1869925) (← links)
- A novel threshold accepting meta-heuristic for the job-shop scheduling problem (Q1885997) (← links)
- How to make OR-results available: A proposal for project scheduling (Q1897419) (← links)
- A generalized permutation approach to job shop scheduling with genetic algorithms (Q1908992) (← links)
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem (Q1969832) (← links)
- Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms (Q1969842) (← links)
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics (Q1978312) (← links)