Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022)

scientific article; zbMATH DE number 7754788

Language	Label	Description	Also known as
English	Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work	scientific article; zbMATH DE number 7754788

Statements

instance of

scholarly article

0 references

title

Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (English)

0 references

0 references

0 references

0 references

0 references

0 references

Naval Research Logistics (NRL)

0 references

publication date

25 October 2023

0 references

zbMATH Keywords

equal-length jobs

0 references

Pareto-optimization

0 references

scheduling

0 references

total weighted late work

0 references

two-agent

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Multiagent Scheduling

0 references

Scheduling Problems with Two Competing Agents

0 references

A multiple-criterion model for machine scheduling

0 references

Temperature aware online algorithms for scheduling equal length jobs

0 references

Q3680271

0 references

Pareto-scheduling of two competing agents with their own equal processing times

0 references

The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs

0 references

Single‐machine scheduling with deadlines to minimize the total weighted late work

0 references

Mirror scheduling problems with early work and late work criteria

0 references

Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date

0 references

Scheduling on parallel identical machines with late work criterion: offline and online cases

0 references

Single machine scheduling with two competing agents, arbitrary release dates and unit processing times

0 references

Scheduling two agents on uniform parallel machines with~makespan and cost functions

0 references

Two-agent scheduling on uniform parallel machines with min-max criteria

0 references

One machine sequencing to minimize mean flow time with minimum number tardy

0 references

Scheduling with competing agents, total late work and job rejection

0 references

A note on competing-agent Pareto-scheduling

0 references

Q4198056

0 references

Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost

0 references

A note on efficient sequences with respect to total flow time and number of tardy jobs

0 references

Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works

0 references

Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work

0 references

Single Machine Scheduling to Minimize Total Weighted Late Work

0 references

Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work

0 references

Multicriteria scheduling

0 references

Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time

0 references

A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work

0 references

On Finding the Maxima of a Set of Vectors

0 references

A dual criteria sequencing problem with earliness and tardiness penalties

0 references

Minimizing total weighted late work on a single-machine with non-availability intervals

0 references

Single-machine scheduling with multi-agents to minimize total weighted late work

0 references

Bicriterion scheduling with equal processing times on a batch processing machine

0 references

Minimizing total late work on a single machine with generalized due-dates

0 references

Single machine scheduling with two competing agents and equal job processing times

0 references

Single Machine Scheduling to Minimize Total Late Work

0 references

Approximation algorithms for scheduling a single machine to minimize total late work

0 references

Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

0 references

Q3378953

0 references

Scheduling a single machine with primary and secondary objectives

0 references

Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs

0 references

A two-agent single-machine scheduling problem with late work criteria

0 references

Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes

0 references

Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work

0 references

Scheduling with release dates and preemption to minimize multiple max-form objective functions

0 references

Two competitive agents to minimize the weighted total late work and the total completion time

0 references

A note on a two-agent scheduling problem related to the total weighted late work

0 references

Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work

0 references

Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption

0 references

Bicriteria scheduling of equal length jobs on uniform parallel machines

0 references

Single-machine scheduling with maintenance activities and rejection

0 references

Identifiers

zbMATH Open document ID

1525.90192

0 references

DOI

10.1002/nav.22103

0 references

Mathematics Subject Classification ID

90B35

0 references

zbMATH DE Number

7754788

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6057022