The following pages link to (Q2743969):
Displayed 16 items.
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem (Q630678) (← links)
- On the complexity of bi-criteria scheduling on a single batch processing machine (Q633556) (← links)
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness (Q856204) (← links)
- Bicriterion scheduling with equal processing times on a batch processing machine (Q947947) (← links)
- Single-machine scheduling under the job rejection constraint (Q964407) (← links)
- Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs (Q990722) (← links)
- A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. (Q1423450) (← links)
- Minimizing makespan subject to minimum total flow-time on identical parallel machines (Q1580983) (← links)
- Using genetic algorithms for single-machine bicriteria scheduling problems (Q1869489) (← links)
- Two-machine flow shop scheduling with two criteria: maximum earliness and makespan (Q1877048) (← links)
- Proportionate flow shop with controllable processing times (Q1964482) (← links)
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs (Q2378377) (← links)
- Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs (Q2566704) (← links)
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs (Q2566940) (← links)
- Multicriteria scheduling problems: a survey (Q2773166) (← links)
- Minimizing makespan subject to minimum flowtime on two identical parallel machines (Q5939974) (← links)