Pages that link to "Item:Q1268192"
From MaRDI portal
The following pages link to A simulated annealing approach for the one-machine mean tardiness scheduling problem (Q1268192):
Displaying 19 items.
- A simulated annealing approach to minimize the maximum lateness on uniform parallel machines (Q552090) (← links)
- A controlled search simulated annealing method for the single machine weighted tardiness problem (Q918386) (← links)
- Minimizing total tardiness on a single machine with controllable processing times (Q1000969) (← links)
- The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
- A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions (Q1207198) (← links)
- An SA/TS mixture algorithm for the scheduling tardiness problem (Q1266621) (← links)
- A semi-infinite programming model for earliness/tardiness production planning with simulated annealing (Q1376761) (← links)
- Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation (Q1609910) (← links)
- Formulating and solving production planning problems (Q1806882) (← links)
- A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert (Q2490218) (← links)
- Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates (Q2514071) (← links)
- A simulated annealing approach to bicriteria scheduling problems on a single machine (Q2567887) (← links)
- Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert (Q2570803) (← links)
- A revised simulated annealing algorithm for obtaining the minimum total tardiness in job shop scheduling problems (Q3366367) (← links)
- A tabu search approach for the single machine mean tardiness problem (Q4346460) (← links)
- Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem (Q4346870) (← links)
- Simulated annealing algorithm for solving the single machine early/tardy problem (Q4895700) (← links)
- Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption (Q4909020) (← links)
- Deep learning-driven scheduling algorithm for a single machine problem minimizing the total tardiness (Q6167662) (← links)