Complexity of single machine, multi-criteria scheduling problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3425355 (Why is no real title available?)
- scientific article; zbMATH DE number 3936913 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 3708086 (Why is no real title available?)
- scientific article; zbMATH DE number 3471786 (Why is no real title available?)
- scientific article; zbMATH DE number 3521521 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A note on a scheduling problem with dual criteria
- Minimizing Total Tardiness on One Machine is NP-Hard
- On general routing problems
- One machine sequencing to minimize mean flow time with minimum number tardy
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Solving a bicriterion scheduling problem
Cited in
(46)- Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
- Counting and enumeration complexity with application to multicriteria scheduling
- Multi-criteria scheduling: an agent-based approach for expert knowledge integration
- Multicriteria scheduling using fuzzy theory and tabu search
- A multivariate complexity analysis of the material consumption scheduling problem
- Finding the Pareto-optima for the total and maximum tardiness single machine problem
- Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs
- Single-machine primary-secondary scheduling with total tardiness being the primary criterion
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Total completion time minimization on multiple machines subject to machine availability and makespan constraints
- Using genetic algorithms for single-machine bicriteria scheduling problems
- On the flexibility of a decision theory-based heuristic for single machine scheduling
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Genetic algorithms for the two-stage bicriteria flowshop problem
- On the complexity of bi-criteria scheduling on a single batch processing machine
- A bicriteria two-machine permutation flowshop problem
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
- Solving multi-objective production scheduling problems using metaheuristics
- Minimizing total completion time and total deviation of job completion times from a restrictive due-date
- Complexity of two dual criteria scheduling problems
- Simultaneous minimization of total completion time and total deviation of job completion times
- Two machine scheduling under disruptions with transportation considerations
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints
- scientific article; zbMATH DE number 52239 (Why is no real title available?)
- scientific article; zbMATH DE number 3860873 (Why is no real title available?)
- The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
- Bi-Objective Flow Shop Scheduling with Equipotential Parallel Machines
- A multiple-criterion model for machine scheduling
- Minimizing flowtime subject to optimal makespan on two identical parallel machines
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Bi-criteria scheduling on a single parallel-batch machine
- Multicriteria scheduling problems: a survey
- New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
- Minimizing makespan subject to minimum flowtime on two identical parallel machines
- Bicriterion scheduling with equal processing times on a batch processing machine
- BICRITERIA SCHEDULING ON SINGLE-MACHINE WITH INVENTORY OPERATIONS
- Multicriteria scheduling
- Parallel machine makespan minimization subject to machine availability and total completion time constraints
- Using Taguchi loss functions to develop a single objective function in a multi-criteria context: a scheduling example
- Minimizing makespan subject to minimum total flow-time on identical parallel machines
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- Complexity of scheduling problems with multi-purpose machines
- Scheduling with time-of-use costs
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
This page was built for publication: Complexity of single machine, multi-criteria scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1309989)
