Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
From MaRDI portal
(Redirected from Publication:1964481)
Recommendations
- Scheduling equal processing time jobs to minimize the weighted number of late jobs
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Preemptive scheduling of equal-length jobs in polynomial time
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Single Machine Scheduling to Minimize Total Weighted Late Work
Cites work
- scientific article; zbMATH DE number 830382 (Why is no real title available?)
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Minimizing late jobs in the general one machine scheduling problem
Cited in
(49)- A note on scheduling equal-length jobs to maximize throughput
- Approximation algorithms for maximum weighted throughput on unrelated machines
- Scheduling satellite launch missions: an MILP approach
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Priority algorithms for the subset-sum problem
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times
- Preemptive scheduling of equal-length jobs to maximize weighted throughput.
- 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
- An efficient approximation for the generalized assignment problem
- On the complexity of speed scaling
- Open shop scheduling problems with late work criteria.
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- Two-agent scheduling on uniform parallel machines with min-max criteria
- Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
- On maximum bipartite matching with separation
- Time-of-use scheduling problem with equal-length jobs
- Branch less, cut more and minimize the number of late equal-length jobs on identical machines
- A decomposition scheme for single stage scheduling problems
- Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times
- Equilibria of greedy combinatorial auctions
- Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- Preemptive scheduling of equal-length jobs in polynomial time
- Parallel machine problems with equal processing times: a survey
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- Throughput scheduling with equal additive laxity
- Throughput scheduling with equal additive laxity
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- The complexity of mean flow time scheduling problems with release times
- Interweaving real-time jobs with energy harvesting to maximize throughput
- Scheduling equal-length jobs on identical parallel machines
- Interweaving real-time jobs with energy harvesting to maximize throughput
- On single-machine scheduling without intermediate delays
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Optimally rescheduling jobs with a last-in-first-out buffer
- Complexity results for flow-shop problems with a single server
- Complexity results for parallel machine problems with a single server
- A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios
- Scheduling a single machine with multiple due dates per job
- Equitable scheduling on a single machine
- On minimizing the weighted number of late jobs in unit execution time open-shops.
- Competitive two-agent scheduling with release dates and preemption on a single machine
- scientific article; zbMATH DE number 781227 (Why is no real title available?)
- Runway sequencing with holding patterns
- Scheduling equal processing time jobs to minimize the weighted number of late jobs
This page was built for publication: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1964481)
