Pages that link to "Item:Q1410613"
From MaRDI portal
The following pages link to Genetic algorithms to minimize the weighted number of late jobs on a single machine. (Q1410613):
Displayed 10 items.
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem (Q429486) (← links)
- Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes (Q693407) (← links)
- Maximizing the weighted number of just-in-time jobs in flow shop scheduling (Q835569) (← links)
- Order acceptance using genetic algorithms (Q1000954) (← links)
- Genetic local search with distance preserving recombination operator for a vehicle routing problem. (Q1410618) (← links)
- Using short-term memory to minimize the weighted number of late jobs on a single machine. (Q1812007) (← links)
- Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times (Q2378452) (← links)
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates (Q2482800) (← links)
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation (Q5187929) (← links)
