Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
From MaRDI portal
Publication:1964481
DOI<245::AID-JOS28>3.0.CO;2-5 10.1002/(SICI)1099-1425(199911/12)2:6<245::AID-JOS28>3.0.CO;2-5zbMath0971.90026MaRDI QIDQ1964481
Publication date: 6 November 2001
Published in: Journal of Scheduling (Search for Journal in Brave)
Related Items
Single machine scheduling with two competing agents, arbitrary release dates and unit processing times, A survey on how the structure of precedence constraints may change the complexity class of scheduling problems, Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs, An efficient approximation for the generalized assignment problem, Single machine scheduling with two competing agents and equal job processing times, Minimizing the weighted number of tardy jobs on a single machine with release dates, A note on scheduling equal-length jobs to maximize throughput, A survey of single machine scheduling to minimize weighted number of tardy jobs, The complexity of mean flow time scheduling problems with release times, On the Complexity of Speed Scaling, Branch less, cut more and minimize the number of late equal-length jobs on identical machines, Scheduling satellite launch missions: an MILP approach, Interweaving real-time jobs with energy harvesting to maximize throughput, Equitable scheduling on a single machine, On minimizing the weighted number of late jobs in unit execution time open-shops., Time-of-use scheduling problem with equal-length jobs, Competitive two-agent scheduling with release dates and preemption on a single machine, Preemptive scheduling of equal-length jobs in polynomial time, On maximum bipartite matching with separation, Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs, Parallel machine problems with equal processing times: a survey, Scheduling two agents on uniform parallel machines with~makespan and cost functions, Open shop scheduling problems with late work criteria., Preemptive scheduling of equal-length jobs to maximize weighted throughput., Optimization of inland shipping. A polynomial time algorithm for the single-ship single-lock optimization problem, On single-machine scheduling without intermediate delays, Runway sequencing with holding patterns, Equilibria of Greedy Combinatorial Auctions, Complexity results for flow-shop problems with a single server, On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation, A decomposition scheme for single stage scheduling problems, Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times, Throughput scheduling with equal additive laxity, Throughput scheduling with equal additive laxity, Two-agent scheduling on uniform parallel machines with min-max criteria, Optimally rescheduling jobs with a last-in-first-out buffer, Priority algorithms for the subset-sum problem, Scheduling equal-length jobs on identical parallel machines, A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems, Complexity results for parallel machine problems with a single server, A branch and bound to minimize the number of late jobs on a single machine with release time constraints
Cites Work
- Unnamed Item
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Minimizing late jobs in the general one machine scheduling problem
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
