A survey of single machine scheduling to minimize weighted number of tardy jobs
From MaRDI portal
(Redirected from Publication:380558)
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Stochastic approximation (62L20) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Approximation algorithms (68W25) Differential geometry of symmetric spaces (53C35) Stochastic scheduling theory in operations research (90B36)
Recommendations
- Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- Stochastic single machine scheduling to minimize the weighted number of tardy jobs
- Single machine scheduling to minimize total weighted tardiness
- Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
- An exact method to minimize the number of tardy jobs in single machine scheduling
Cites work
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- scientific article; zbMATH DE number 96059 (Why is no real title available?)
- scientific article; zbMATH DE number 3521521 (Why is no real title available?)
- scientific article; zbMATH DE number 3550182 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3617544 (Why is no real title available?)
- scientific article; zbMATH DE number 3633982 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1355185 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 866105 (Why is no real title available?)
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A Simple Optimality Proof of Moore's Sequencing Algorithm
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- A concise survey of scheduling with time-dependent processing times
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- A note on scheduling equal-length jobs to maximize throughput
- A note on the optimality proof of the Kise-Ibaraki-Mine algorithm
- A simulated annealing approach to bicriteria scheduling problems on a single machine
- A survey of scheduling problems with setup times or costs
- A survey of scheduling with controllable processing times
- Algorithm for minimizing weighted earliness penalty in single-machine problem
- Algorithms for Scheduling Independent Tasks
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
- Batching identical jobs
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
- Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- Complexity of single machine hierarchical scheduling: A survey
- Complexity of single machine, multi-criteria scheduling problems
- Complexity of two dual criteria scheduling problems
- Complexity results for scheduling chains on a single machine
- Deterministic job-shop scheduling: Past, present and future
- Dynamic scheduling of stochastic jobs on a single machine
- Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
- Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
- Minimizing late jobs in the general one machine scheduling problem
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
- Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- Minimizing the expected number of tardy jobs when processing times are normally distributed
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- Minimizing the number of tardy job units under release time constraints
- Minimizing the number of tardy jobs in single machine sequencing
- Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
- Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
- Minimizing the weighted number of tardy jobs on a single machine
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Multi-agent single machine scheduling
- Multicriteria scheduling
- Multiple and bicriteria scheduling: A literature survey
- Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
- On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs
- On general routing problems
- On the Complexity of Scheduling with Batch Setup Times
- On the minimization of the weighted number of tardy jobs with random processing times and deadline
- On-line scheduling on a single machine: Maximizing the number of early jobs
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine problems with equal processing times: a survey
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Preemptive scheduling of equal-length jobs to maximize weighted throughput.
- Scheduling Groups of Jobs on a Single Machine
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- Scheduling a batching machine
- Scheduling equal processing time jobs to minimize the weighted number of late jobs
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
- Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Scheduling with batching: A review
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
- Sequencing with Earliness and Tardiness Penalties: A Review
- Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
- Single machine scheduling to minimize the number of early and tardy jobs
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Single-machine scheduling to minimize the weighted number of early and tardy agreeable jobs
- Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
- Stochastic Scheduling with Release Dates and Due Dates
- Supply Chain Scheduling: Batching and Delivery
- Survey of scheduling research involving due date determination decisions
- Survey of scheduling research involving setup times
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- The complexity of one-machine batching problems
- The coordination of scheduling and batch deliveries
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Using genetic algorithms for single-machine bicriteria scheduling problems
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
Cited in
(18)- New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives
- A study on the enhanced best performance algorithm for the just-in-time scheduling problem
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
- Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases
- A note on lot scheduling on a single machine to minimize maximum weighted tardiness
- Minimizing the number of tardy jobs for the single machine scheduling problem: MIP-based lower and upper bounds
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines
- Server cloud scheduling
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Multi-machine scheduling lower bounds using decision diagrams
- Modeling single machine preemptive scheduling problems for computational efficiency
- Mathematical model applied to single-track line scheduling problem in Brazilian railways
- Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- Weighted Tardiness Single Machine Scheduling with Proportional Weights
- Equitable scheduling on a single machine
- Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs
- Minimizing the weighted number of tardy jobs on multiple machines: a review
This page was built for publication: A survey of single machine scheduling to minimize weighted number of tardy jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q380558)
