Pages that link to "Item:Q1869489"
From MaRDI portal
The following pages link to Using genetic algorithms for single-machine bicriteria scheduling problems (Q1869489):
Displaying 12 items.
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem (Q630678) (← links)
- Genetic algorithms to solve the cover printing problem (Q883299) (← links)
- Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs (Q990722) (← links)
- New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs (Q1044141) (← links)
- Genetic algorithms for the two-stage bicriteria flowshop problem (Q1278393) (← links)
- Genetic algorithms to minimize the weighted number of late jobs on a single machine. (Q1410613) (← links)
- An efficient genetic algorithm for job shop scheduling with tardiness objectives. (Q1427583) (← links)
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs (Q2378377) (← links)
- Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example (Q2379867) (← links)
- Pareto optima for total weighted completion time and maximum lateness on a single machine (Q2457015) (← links)
- A genetic algorithm-based approach to machine assignment problem (Q5466733) (← links)
