Pages that link to "Item:Q1001005"
From MaRDI portal
The following pages link to A population-based variable neighborhood search for the single machine total weighted tardiness problem (Q1001005):
Displaying 25 items.
- A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times (Q337074) (← links)
- Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity (Q339549) (← links)
- An iterative approach for the serial batching problem with parallel machines and job families (Q363588) (← links)
- Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness (Q398925) (← links)
- A simultaneous and iterative approach for parallel machine scheduling with sequence-dependent family setups (Q490356) (← links)
- On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification (Q613434) (← links)
- Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness (Q613514) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem (Q1433664) (← links)
- A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem (Q1628071) (← links)
- An improved particle swarm optimization for selective single machine scheduling with sequence dependent setup costs and downstream demands (Q1666342) (← links)
- A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine (Q1762139) (← links)
- Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties (Q1791909) (← links)
- A variable neighborhood descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times (Q1791956) (← links)
- A Pareto-based adaptive variable neighborhood search for biobjective hybrid flow shop scheduling problem with sequence-dependent setup time (Q1792653) (← links)
- Variable neighbourhood structures for cycle location problems (Q1926979) (← links)
- Analysis of variable neighborhood descent as a local search operator for total weighted tardiness problem on unrelated parallel machines (Q2297569) (← links)
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs (Q2438422) (← links)
- Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem (Q2510186) (← links)
- A HYBRID METAHEURISTIC FOR THE SINGLE-MACHINE TOTAL WEIGHTED TARDINESS PROBLEM (Q2790358) (← links)
- Applying variable neighborhood search to the single-machine maximum lateness rescheduling problem (Q2840760) (← links)
- RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect (Q5883594) (← links)
- Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates (Q5889183) (← links)
- Variable neighborhood search for the single machine scheduling problem to minimize the total early work (Q6063510) (← links)
