Pages that link to "Item:Q1807948"
From MaRDI portal
The following pages link to Deterministic job-shop scheduling: Past, present and future (Q1807948):
Displaying 50 items.
- A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem (Q319274) (← 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)
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements (Q342448) (← links)
- Solving job shop problems in the context of hypergraphs (Q351548) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- An artificial bee colony algorithm for the job shop scheduling problem with random processing times (Q400942) (← links)
- A PMBGA to optimize the selection of rules for job shop scheduling based on the Giffler-Thompson algorithm (Q411034) (← links)
- A general approach for optimizing regular criteria in the job-shop scheduling problem (Q418093) (← links)
- Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots (Q420153) (← links)
- Bottleneck machine identification method based on constraint transformation for job shop scheduling with genetic algorithm (Q454950) (← links)
- Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling (Q508765) (← links)
- On one approach to constructing timetables of freight trains in a railroad network (Q510295) (← links)
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time (Q613775) (← links)
- A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem (Q622145) (← links)
- An agent-based parallel approach for the job shop scheduling problem with genetic algorithms (Q630749) (← links)
- A time-indexed LP-based approach for min-sum job-shop problems (Q646647) (← links)
- Tabu search algorithms for job-shop problems with a single transport robot (Q707135) (← links)
- Solving job shop scheduling problems utilizing the properties of backbone and ``big valley'' (Q707768) (← links)
- Models for equipment selection and upgrade in manufacturing systems of machine building enterprises (Q747333) (← links)
- Problem difficulty for tabu search in job-shop scheduling (Q814423) (← links)
- Permutation-induced acyclic networks for the job shop scheduling problem (Q840194) (← 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)
- A new neighborhood and tabu search for the blocking job shop (Q967433) (← links)
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility (Q988383) (← 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)
- 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)
- A hybrid metaheuristic algorithm to optimise a real-world robotic cell (Q1652331) (← links)
- A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem (Q1652506) (← links)
- Risk measure of job shop scheduling with random machine breakdowns (Q1654341) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- Solving flexible job-shop scheduling problem using gravitational search algorithm and colored Petri net (Q1760793) (← 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)
- Multi-resource allocation in stochastic project scheduling (Q1931636) (← links)
- A hybrid multiobjective evolutionary approach for flexible job-shop scheduling problems (Q1954823) (← links)
- Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem (Q2031353) (← links)
