Pages that link to "Item:Q4002567"
From MaRDI portal
The following pages link to Single-machine bicriteria scheduling (Q4002567):
Displaying 34 items.
- An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem (Q336962) (← links)
- Bi-criteria scheduling on a single parallel-batch machine (Q437901) (← links)
- Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost (Q457296) (← 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)
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption (Q1041716) (← links)
- Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine (Q1184462) (← links)
- A new lower bound approach for single-machine multicriteria scheduling (Q1198623) (← links)
- Complexity of single machine, multi-criteria scheduling problems (Q1309989) (← links)
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. (Q1426457) (← links)
- Exploiting process plan flexibility in production scheduling: A multi-objective approach (Q1809824) (← links)
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem (Q1848361) (← links)
- Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123) (← links)
- Using genetic algorithms for single-machine bicriteria scheduling problems (Q1869489) (← links)
- Solving multi-objective production scheduling problems using metaheuristics (Q1887769) (← links)
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time (Q1924612) (← links)
- Proportionate flow shop with controllable processing times (Q1964482) (← links)
- An approximation scheme for the bi-scenario sum of completion times trade-off problem (Q2283294) (← links)
- Single-machine multi-agent scheduling problems with a global objective function (Q2434286) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs (Q2566940) (← links)
- Stochastic bicriteria single machine scheduling with quadratic cost functions (Q2627399) (← links)
- Multicriteria scheduling problems: a survey (Q2773166) (← links)
- BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS (Q3397512) (← links)
- Sequencing heuristic for bicriteria scheduling in a single machine problem (Q3411893) (← links)
- (Q4387183) (← links)
- Note: Bicriteria scheduling for minimizing flow time and maximum tardiness (Q4715989) (← links)
- Multi‐objective combinatorial optimization problems: A survey (Q4896386) (← links)
- A heuristic approach to bicriteria scheduling (Q4934193) (← links)
- A Class of Single Machine Central Tendency-Dispersion Bicriteria Problems (Q5690272) (← links)
- Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)
- Scheduling with target start times (Q5925938) (← links)
- Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry (Q5954825) (← links)
- Local search heuristics for two-stage flow shop problems with secondary criterion (Q5955475) (← links)
