One machine sequencing to minimize mean flow time with minimum number tardy
From MaRDI portal
Cited in
(21)- New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- Multiple and bicriteria scheduling: A literature survey
- Use of variable range in solving multiple criteria scheduling problems
- Genetic algorithms for the two-stage bicriteria flowshop problem
- Complexity of single machine, multi-criteria scheduling problems
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Heuristic methods and applications: A categorized survey
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
- A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times
- Multicriteria scheduling
- Complexity of two dual criteria scheduling problems
- Multicriteria scheduling problems: a survey
- Single-machine scheduling with maintenance in a manufacturing system
- BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS
- A bi-criterion algorithm for minimizing machine interference and reducing job waiting time
- A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness
- Counting and enumeration complexity with application to multicriteria scheduling
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
- Tradeoff between setup times and carrying costs for finished items
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
This page was built for publication: One machine sequencing to minimize mean flow time with minimum number tardy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4077051)
