Pages that link to "Item:Q1207198"
From MaRDI portal
The following pages link to A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions (Q1207198):
Displaying 15 items.
- Completion time variance minimization in single machine and multi-machine systems (Q733521) (← links)
- Bounds for the position of the smallest job in completion time variance minimization (Q1296376) (← links)
- Pseudopolynomial algorithms for CTV minimization in single machine scheduling (Q1373152) (← links)
- \(V\)- and \(\Lambda\)-shaped properties for optimal single machine schedules for a class of non-separable penalty functions (Q1390208) (← links)
- A composite heuristic for the single machine early/tardy job scheduling problem. (Q1406666) (← links)
- A branch and bound algorithm to minimize completion time variance on a single processor. (Q1413810) (← links)
- Completion time variance minimisation on two identical parallel processors (Q1652377) (← links)
- Algorithms based on VNS for solving the single machine scheduling problem with earliness and tardiness penalties (Q1791909) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- A simulated annealing approach to bicriteria scheduling problems on a single machine (Q2567887) (← links)
- Minimization of total absolute deviation for a common due date (Q3534456) (← links)
- Tabu search for a class of single-machine scheduling problems (Q5945325) (← links)
