Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine
From MaRDI portal
Publication:2686863
DOI10.3934/mbe.2022346OpenAlexW4283318848MaRDI QIDQ2686863
Publication date: 28 February 2023
Published in: Mathematical Biosciences and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/mbe.2022346
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
- Pareto minimizing total completion time and maximum cost with positional due indices
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- Solving a bicriterion scheduling problem
- A note on Pareto minimizing total completion time and maximum cost
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Multiple criteria model for allocating new medical robotic devices to treatment centres
- Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
- Parallel machine problems with equal processing times: a survey
- Pareto optima for total weighted completion time and maximum lateness on a single machine
- Multicriteria scheduling
- Optimal Batch Schedules for Parallel Machines
- A note on a scheduling problem with dual criteria
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
This page was built for publication: Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine
