An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

Cited in

(only showing first 100 items - show all)

Priority algorithms for the subset-sum problem
Single machine scheduling problems with position-dependent processing times
The counting complexity of a simple scheduling problem
Scheduling jobs under decreasing linear deterioration
New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
Scheduling on machines with variable service rates
k-optimal solution sets for some polynomially solvable scheduling problems
A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
Minimizing the number of tardy jobs for m parallel machines
Multiple and bicriteria scheduling: A literature survey
Minimizing late jobs in the general one machine scheduling problem
Complexity results for scheduling chains on a single machine
On the complexity of generalized due date scheduling problems
Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming
Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine
Single machine scheduling subject to deadlines and resource dependent processing times
An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
Parallel machine scheduling to minimize costs for earliness and number of tardy jobs
Single-machine scheduling to minimize earliness and number of tardy jobs
An optimal scheduling algorithm for preemptable real-time tasks
An ordered independence system and its applications to scheduling problems
Scheduling jobs under simple linear deterioration
Incorporating preference information into multi-objective scheduling
The stochastic single machine scheduling problem with earliness and tardiness costs
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
Flowshop scheduling with dominant machines
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
Approximate algorithms for the \(P\parallel C_{\max}\) problem
Single machine scheduling with discretely controllable processing times
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
Genetic algorithms to minimize the weighted number of late jobs on a single machine.
Minimizing the weighted number of tardy jobs on a two-machine flow shop.
Single machine scheduling to minimize the number of late jobs under uncertainty.
A note on the maximum number of on-time jobs on parallel identical machines.
Parallel machine scheduling with a common server
Parallel machine scheduling with splitting jobs
Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
Single machine scheduling with assignable due dates
On the flexibility of a decision theory-based heuristic for single machine scheduling
Complexities of four problems on two-agent scheduling
A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
A hybrid meta-heuristic algorithm to minimize the number of tardy jobs in a dynamic two-machine flow shop problem
Throughput maximization for speed scaling with agreeable deadlines
Scheduling on parallel identical machines with late work criterion: offline and online cases
A theory and algorithms for combinatorial reoptimization
Single-machine scheduling with supporting tasks
Scheduling with time-of-use costs
Minimizing the number of late jobs when the start time of the machine is variable
Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance
Scheduling problems with position dependent job processing times: computational complexity results
An exact approach for scheduling jobs with regular step cost functions on a single machine
Coordination in a two-stage production system: complexity, conflict and cooperation
No-wait or no-idle permutation flowshop scheduling with dominating machines
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
A possibilistic approach to sequencing problems with fuzzy parameters
A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
One machine scheduling problem with fuzzy random due-dates
Deterministic job-shop scheduling: Past, present and future
Using short-term memory to minimize the weighted number of late jobs on a single machine.
Scheduling theory problems of type \(n|1|\sum c_i(t)\)
Minimizing the weighted number of tardy jobs on a single machine
Using genetic algorithms for single-machine bicriteria scheduling problems
A branch and bound to minimize the number of late jobs on a single machine with release time constraints
A new rule for minimizing the number of tardy jobs in dynamic flow shops
Minimizing the weighted number of tardy jobs on parallel processors
A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs
Single machine scheduling to minimize the number of early and tardy jobs
Branch less, cut more and minimize the number of late equal-length jobs on identical machines
Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
Scheduling with batching: A review
Scheduling the production of two-component jobs on a single machine
Minimizing tardy jobs in a flowshop with common due date
Minimizing functions of infeasibilities in a two-machine flow shop
Scheduling with limited machine availability
Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags
Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
\(\mathrm{A}^*\)-based construction of decision diagrams for a prize-collecting scheduling problem
Revisit of the scheduling problems with integrated production and delivery on parallel batching machines
Scheduling in multi-scenario environment with an agreeable condition on job processing times
Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances
A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
On the fine-grained parameterized complexity of partial scheduling to minimize the makespan
On scheduling a deteriorating rate-modifying activity to minimize the number of tardy jobs
The quality of equilibria for set packing and throughput scheduling games
A survey of due-date related single-machine with two-agent scheduling problem
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
Parameterized multi-scenario single-machine scheduling problems
Lot scheduling on a single machine to minimize the (weighted) number of tardy orders
Single-machine scheduling with maintenance activities and rejection
Scheduling to tradeoff between the number and the length of accepted jobs
A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times
A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine

This page was built for publication: An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5548719)