Pages that link to "Item:Q1268188"
From MaRDI portal
The following pages link to The job shop scheduling problem: Conventional and new solution techniques (Q1268188):
Displaying 50 items.
- Job-shop production scheduling with reverse flows (Q319298) (← links)
- Path-relinking tabu search for the multi-objective flexible job shop scheduling problem (Q337004) (← links)
- Depth-first heuristic search for the job shop scheduling problem (Q363574) (← links)
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time (Q613775) (← links)
- A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective (Q614062) (← 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)
- Problem difficulty for tabu search in job-shop scheduling (Q814423) (← links)
- Scheduling the truckload operations in automatic warehouses (Q863986) (← links)
- A multi-objective particle swarm for a flow shop scheduling problem (Q867030) (← links)
- A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem (Q883284) (← links)
- Genetic algorithm modification for production scheduling (Q902742) (← links)
- A branch and bound method for the job-shop problem with sequence-dependent setup times (Q940884) (← links)
- Fuzzy job shop scheduling with lot-sizing (Q940894) (← links)
- Ant colony optimization combined with taboo search for the job shop scheduling problem (Q941529) (← links)
- Time-optimal coordination of flexible manufacturing systems using deterministic finite automata and mixed integer linear programming (Q977004) (← links)
- Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound (Q1010284) (← 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)
- Lot sizing and scheduling -- survey and extensions (Q1278770) (← links)
- Heuristics for scheduling with inventory: Dynamic focus via constraint criticality (Q1347601) (← links)
- Optimal makespan scheduling with given bounds of processing times (Q1381777) (← links)
- A repairing technique for the local search of the job-shop problem. (Q1417509) (← links)
- An efficient genetic algorithm for job shop scheduling with tardiness objectives. (Q1427583) (← links)
- Constraint propagation techniques for the disjunctive scheduling problem (Q1583518) (← links)
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing (Q1584823) (← links)
- Genetic multi-criteria approach to flexible line scheduling (Q1606204) (← links)
- A guided local search with iterative ejections of bottleneck operations for the job shop scheduling problem (Q1652506) (← links)
- Multiobjective order assignment optimization in a global multiple-factory environment (Q1718905) (← links)
- Open shop cyclic scheduling (Q1750495) (← links)
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints (Q1752766) (← links)
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
- Some new results on simulated annealing applied to the job shop scheduling problem (Q1806648) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic (Q1848643) (← 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)
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics (Q1978312) (← links)
- Packing-based branch-and-bound for discrete malleable task scheduling (Q2093190) (← links)
- A survey of job shop scheduling problem: the types and models (Q2146994) (← links)
- Efficient primal heuristic updates for the blocking job shop problem (Q2239845) (← links)
- Multiobjective optimization for complex flexible job-shop scheduling problems (Q2239940) (← links)
- Generalised accelerations for insertion-based heuristics in permutation flowshop scheduling (Q2286871) (← 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)
- A neighborhood for complex job shop scheduling problems with regular objectives (Q2400045) (← links)
- An advanced tabu search algorithm for the job shop problem (Q2464439) (← links)
- No-wait job shop scheduling: tabu search and complexity of subproblems (Q2474557) (← links)
