A survey of single machine scheduling to minimize weighted number of tardy jobs
From MaRDI portal
Publication:380558
DOI10.3934/jimo.2014.10.219zbMath1276.90001OpenAlexW2328035979MaRDI QIDQ380558
Aderemi O. Adewumi, Muminu O. Adamu
Publication date: 14 November 2013
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2014.10.219
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Stochastic scheduling theory in operations research (90B36) Stochastic approximation (62L20) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Differential geometry of symmetric spaces (53C35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)
Related Items (15)
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ New algorithms for minimizing the weighted number of tardy jobs on a single machine ⋮ A binary multiple knapsack model for single machine scheduling with machine unavailability ⋮ Unary NP-hardness of minimizing the number of tardy jobs with deadlines ⋮ Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work ⋮ Equitable scheduling on a single machine ⋮ Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs ⋮ New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives ⋮ Mathematical model applied to single-track line scheduling problem in Brazilian railways ⋮ A study on the enhanced best performance algorithm for the just-in-time scheduling problem ⋮ Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases ⋮ Server cloud scheduling ⋮ Modeling single machine preemptive scheduling problems for computational efficiency ⋮ Multi-machine scheduling lower bounds using decision diagrams ⋮ Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
Cites Work
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
- Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
- Minimizing the number of tardy jobs in single machine sequencing
- Algorithm for minimizing weighted earliness penalty in single-machine problem
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- The coordination of scheduling and batch deliveries
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- Scheduling equal processing time jobs to minimize the weighted number of late jobs
- Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
- Minimizing the weighted number of early and tardy jobs in a stochastic single machine scheduling problem
- A note on scheduling equal-length jobs to maximize throughput
- Minimizing the number of tardy job units under release time constraints
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances
- Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Survey of scheduling research involving due date determination decisions
- 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 minimization of the weighted number of tardy jobs with random processing times and deadline
- 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
- Scheduling a batching machine
- Impact of learning and fatigue factors on single machine scheduling with penalties for tardy jobs
- An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
- Complexity of single machine, multi-criteria scheduling problems
- The complexity of one-machine batching problems
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Scheduling with batching: Minimizing the weighted number of 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
- Batching identical jobs
- A concise survey of scheduling with time-dependent processing times
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
- Preemptive scheduling of equal-length jobs to maximize weighted throughput.
- Dynamic scheduling of stochastic jobs on a single machine
- Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
- Minimizing weighted number of early and tardy jobs with a common due window involving location penalty
- Minimizing the expected number of tardy jobs when processing times are normally distributed
- Deterministic job-shop scheduling: Past, present and future
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- 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
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
- Single machine scheduling to minimize the number of early and tardy jobs
- Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
- Scheduling with batching: A review
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs
- A survey of scheduling with controllable processing times
- Parallel machine problems with equal processing times: a survey
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs
- A survey of scheduling problems with setup times or costs
- Multi-agent single machine scheduling
- A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Multicriteria scheduling
- A simulated annealing approach to bicriteria scheduling problems on a single machine
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Complexity of two dual criteria scheduling problems
- A Note on the Optimality Proof of the Kise-Ibaraki-Mine Algorithm
- Sequencing with Earliness and Tardiness Penalties: A Review
- Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine
- Supply Chain Scheduling: Batching and Delivery
- Note—On Baluts Algorithm and NP-Completeness for a Chance-Constrained Scheduling Problem
- Stochastic Scheduling with Release Dates and Due Dates
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
- Algorithms for Scheduling Independent Tasks
- Scheduling Tasks with Nonuniform Deadlines on Two Processors
- On general routing problems
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
- On the Complexity of Scheduling with Batch Setup Times
- Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
- Survey of scheduling research involving setup times
- Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
- Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
- Scheduling Groups of Jobs on a Single Machine
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs
- A Simple Optimality Proof of Moore's Sequencing Algorithm
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- On-line scheduling on a single machine: Maximizing the number of early jobs
- Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A survey of single machine scheduling to minimize weighted number of tardy jobs
