Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3934/mbe.2022346 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4283318848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple criteria model for allocating new medical robotic devices to treatment centres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto optima for total weighted completion time and maximum lateness on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a bicriterion scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Pareto minimizing total completion time and maximum cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto minimizing total completion time and maximum cost with positional due indices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine problems with equal processing times: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a scheduling problem with dual criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Batch Schedules for Parallel Machines / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:59, 31 July 2024

scientific article
Language Label Description Also known as
English
Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine
scientific article

    Statements

    Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (English)
    0 references
    0 references
    0 references
    0 references
    28 February 2023
    0 references
    0 references
    scheduling
    0 references
    Pareto optimization
    0 references
    single machine
    0 references
    total weighted completion time
    0 references
    maximum cost
    0 references
    0 references