Pages that link to "Item:Q1807948"
From MaRDI portal
The following pages link to Deterministic job-shop scheduling: Past, present and future (Q1807948):
Displayed 39 items.
- Tabu search algorithms for job-shop problems with a single transport robot (Q707135) (← links)
- Problem difficulty for tabu search in job-shop scheduling (Q814423) (← links)
- A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: the case of job shop scheduling (Q857328) (← links)
- An effective architecture for learning and evolving flexible job-shop schedules (Q858446) (← links)
- Scheduling the truckload operations in automatic warehouses (Q863986) (← links)
- An algorithm for the job shop scheduling problem based on global equilibrium search techniques (Q867431) (← links)
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
- A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
- Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
- The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure. (Q1410335) (← links)
- Approximative procedures for no-wait job shop scheduling. (Q1413924) (← links)
- A repairing technique for the local search of the job-shop problem. (Q1417509) (← links)
- An experimental analysis of local minima to improve neighbourhood search. (Q1422374) (← links)
- On not-first/not-last conditions in disjunctive scheduling (Q1590039) (← links)
- Job shop scheduling with beam search (Q1806850) (← links)
- A knowledge-based evolutionary strategy for scheduling problems with bottlenecks (Q1869426) (← 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)
- Scheduling with timed automata (Q2368955) (← links)
- A hybrid heuristic to solve the parallel machines job-shop scheduling problem (Q2378080) (← links)
- A very fast TS/SA algorithm for the job shop scheduling problem (Q2384605) (← links)
- Optimization of logistic systems using fuzzy weighted aggregation (Q2455538) (← links)
- Surgical case scheduling as a generalized job shop scheduling problem (Q2464181) (← links)
- An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
- Multicriteria optimisation and simulation: an industrial application (Q2468761) (← links)
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem (Q2471233) (← 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)
- Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem (Q2489308) (← links)
- An enhanced timetabling procedure for the no-wait job shop problem: a complete local search approach (Q2496019) (← links)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem (Q3498886) (← links)
- Multiple colony ant algorithm for job-shop scheduling problem (Q3518511) (← links)
- A genetic algorithm and the Monte Carlo method for stochastic job-shop scheduling (Q4814097) (← links)
- A machine-order search space for job-shop scheduling problems (Q4814098) (← links)
- Optimal scheduling for flexible job shop operation (Q5466730) (← links)
- Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments (Q5932283) (← links)
- An effective hybrid optimization strategy for job-shop scheduling problems (Q5936137) (← links)