A survey of single machine scheduling to minimize weighted number of tardy jobs

DOI10.3934/JIMO.2014.10.219zbMATH Open1276.90001OpenAlexW2328035979MaRDI QIDQ380558FDOQ380558

Authors: Muminu O. Adamu, Aderemi O. Adewumi 

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

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

zbMATH Keywords

schedulingsingle machinejust-in-timebatchingprecedence constraint

Mathematics Subject Classification ID

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)

Cites Work

• Algorithm for minimizing weighted earliness penalty in single-machine problem
• 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
• Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Scheduling with batching: A review
• A survey of scheduling with controllable processing times
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Title not available (Why is that?)
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Scheduling a batching machine
• Algorithms for Scheduling Independent Tasks
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• Parallel machine problems with equal processing times: a survey
• A survey of scheduling problems with setup times or costs
• Multi-agent single machine scheduling
• Title not available (Why is that?)
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
• Complexity of single machine, multi-criteria scheduling problems
• Minimizing the weighted number of tardy jobs on a single machine
• Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
• Complexity of single machine hierarchical scheduling: A survey
• Supply Chain Scheduling: Batching and Delivery
• Scheduling to minimize maximum earliness and number of tardy jobs where machine idle time is allowed
• Scheduling Groups of Jobs on a Single Machine
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• On-line scheduling on a single machine: Maximizing the number of early jobs
• Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem
• The coordination of scheduling and batch deliveries
• 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
• Survey of scheduling research involving due date determination decisions
• The complexity of one-machine batching problems
• Batching identical jobs
• Multicriteria scheduling
• On general routing problems
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• On the Complexity of Scheduling with Batch Setup Times
• Minimizing number of tardy jobs on a batch processing machine with incompatible job families
• Complexity results for scheduling chains on a single machine
• Dynamic scheduling of stochastic jobs on a single machine
• Deterministic job-shop scheduling: Past, present and future
• Minimizing the weighted number of tardy jobs on a single machine with release dates
• A concise survey of scheduling with time-dependent processing times
• Using short-term memory to minimize the weighted number of late jobs on a single machine.
• Sequencing with Earliness and Tardiness Penalties: A Review
• Title not available (Why is that?)
• Minimizing the number of tardy job units under release time constraints
• On the minimization of the weighted number of tardy jobs with random processing times and deadline
• 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
• Title not available (Why is that?)
• Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
• A new branch and bound algorithm for minimizing the weighted number of tardy jobs
• Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
• Survey of scheduling research involving setup times
• Title not available (Why is that?)
• Multiple and bicriteria scheduling: A literature survey
• Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
• Branch and bound algorithms for single machine scheduling with batching to minimize the number of late 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
• Minimizing late jobs in the general one machine scheduling problem
• Minimizing mean tardiness subject to unspecified minimum number tardy for a single 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
• 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
• Genetic algorithms to minimize the weighted number of late jobs on a single machine.
• Preemptive scheduling of equal-length jobs to maximize weighted throughput.
• 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
• 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
• 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 bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates
• A simulated annealing approach to bicriteria scheduling problems on a single machine
• Complexity of two dual criteria scheduling problems
• A note on the optimality proof of the Kise-Ibaraki-Mine algorithm
• Approximation Algorithm for Minimizing the Weighted Number of Tardy Jobs on a Batch Machine
• Title not available (Why is that?)
• Title not available (Why is that?)
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• Title not available (Why is that?)
• Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine
• Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
• On Sequencing n Jobs on One Machine to Minimize the Number of Late Jobs
• A Simple Optimality Proof of Moore's Sequencing Algorithm
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
• Minimizing the number of tardy jobs in single machine sequencing

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
• Stochastic single machine scheduling problem as a multi-stage dynamic random decision process
• Mathematical model applied to single-track line scheduling problem in Brazilian railways
• 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)