Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
From MaRDI portal
(Redirected from Publication:1905089)
Recommendations
- On bicriteria scheduling of due date assignment and weighted number of tardy jobs
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- On the minimization of the weighted number of tardy jobs with random processing times and deadline
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- scientific article; zbMATH DE number 123937
- Minimizing total weighted tardiness for scheduling equal-length jobs on a single machine
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
Cites work
- scientific article; zbMATH DE number 3786124 (Why is no real title available?)
- scientific article; zbMATH DE number 3558962 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- Maximum matching in a convex bipartite graph
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling unit processing time jobs on a single machine with multiple criteria
- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming
- Some clarifications on the bicriteria scheduling of unit execution time jobs on a single machine
Cited in
(21)- Scheduling interfering job sets on parallel machines
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- A survey of due-date related single-machine with two-agent scheduling problem
- Parameterized multi-scenario single-machine scheduling problems
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- Single machine scheduling with two competing agents and equal job processing times
- Scheduling two job families on a single machine with two competitive agents
- Single machine scheduling with interfering job sets
- A single-machine bi-criterion scheduling problem with two agents
- Proportionate flow shop scheduling with two competing agents to minimize weighted late work and weighted number of late jobs
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- A state-of-the-art survey on multi-scenario scheduling
- Two-agent scheduling of equal-length jobs on uniform parallel machines
- Minimizing the weighted number of tardy jobs is W[1]-hard
- Minimizing the weighted number of tardy jobs is W[1]-hard
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
This page was built for publication: Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1905089)
