Hybrid algorithm for sequencing with bicriteria
From MaRDI portal
Cites work
- A Dynamic Programming Approach to Sequencing Problems
- A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
- An experimental comparison of solution algorithms for the single-machine tardiness problem
- Dynamic Programming Solution of Sequencing Problems with Precedence Constraints
- Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3594864 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- Linear multiobjective programming
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
Cited in
(9)- Multiple and bicriteria scheduling: A literature survey
- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming
- An interactive procedure for bi-criteria production scheduling
- Incorporating preference information into multi-objective scheduling
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
- A bicriteria scheduling with sequence-dependent setup times
- Multicriteria scheduling problems: a survey
- Multicriteria scheduling using fuzzy theory and tabu search
- Counting and enumeration complexity with application to multicriteria scheduling
This page was built for publication: Hybrid algorithm for sequencing with bicriteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1162274)