A note on a scheduling problem with dual criteria
From MaRDI portal
Publication:4074651
DOI10.1002/nav.3800220317zbMath0314.90045OpenAlexW2075980457MaRDI QIDQ4074651
Publication date: 1975
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800220317
Related Items (19)
Single machine scheduling to minimize weighted earliness subject to no tardy jobs ⋮ Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness ⋮ Complexity of two dual criteria scheduling problems ⋮ A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness ⋮ Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty ⋮ Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time ⋮ Multiple and bicriteria scheduling: A literature survey ⋮ Solving a bicriterion scheduling problem ⋮ Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines ⋮ Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine ⋮ An improved branch and bound algorithm for single machine scheduling with deadlines to minimize total weighted completion time. ⋮ Reducibility among single machine weighted completion time scheduling problems ⋮ An algorithm for single machine sequencing with deadlines to minimize total weighted completion time ⋮ Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming ⋮ Tradeoff between setup times and carrying costs for finished items ⋮ Multicriteria scheduling problems: a survey ⋮ Scheduling unit processing time jobs on a single machine with multiple criteria ⋮ Multicriteria scheduling ⋮ Complexity of single machine, multi-criteria scheduling problems
This page was built for publication: A note on a scheduling problem with dual criteria
