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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
Single machine scheduling with two competing agents and equal job processing times
Temperature aware online algorithms for scheduling equal length jobs
Two-agent scheduling on uniform parallel machines with min-max criteria
Bicriterion scheduling with equal processing times on a batch processing machine
Approximation algorithms for scheduling a single machine to minimize total late work
A two-agent single-machine scheduling problem with late work criteria
Scheduling on parallel identical machines with late work criterion: offline and online cases
Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
A note on competing-agent Pareto-scheduling
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
Minimizing total late work on a single machine with generalized due-dates
Mirror scheduling problems with early work and late work criteria
Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works
Pareto-scheduling of two competing agents with their own equal processing times
Minimizing total weighted late work on a single-machine with non-availability intervals
Single-machine scheduling with multi-agents to minimize total weighted late work
Single-machine scheduling with maintenance activities and rejection
Two competitive agents to minimize the weighted total late work and the total completion time
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
Bicriteria scheduling of equal length jobs on uniform parallel machines
Scheduling with release dates and preemption to minimize multiple max-form objective functions
Scheduling a single machine with primary and secondary objectives
Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost
A note on a two-agent scheduling problem related to the total weighted late work
Scheduling two agents on uniform parallel machines with~makespan and cost functions
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
A multiple-criterion model for machine scheduling
Multicriteria scheduling
Scheduling with competing agents, total late work and job rejection
Scheduling Problems with Two Competing Agents
Single Machine Scheduling to Minimize Total Late Work
One machine sequencing to minimize mean flow time with minimum number tardy
On Finding the Maxima of a Set of Vectors
A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
A dual criteria sequencing problem with earliness and tardiness penalties
Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations
Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
A note on efficient sequences with respect to total flow time and number of tardy jobs
Single Machine Scheduling to Minimize Total Weighted Late Work
Single‐machine scheduling with deadlines to minimize the total weighted late work
Multiagent Scheduling
Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work

This page was built for publication: Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work