Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs

DOI10.1016/S0020-0190(98)00153-7zbMATH Open1337.90026MaRDI QIDQ293435FDOQ293435

Authors: V. S. Gordon, Wieslaw Kubiak 

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001537?np=y

Recommendations

• The problem of minimizing the weighted number of late jobs to meet strict deadlines and due processing times.
• Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
• Common due date assignment and single-machine scheduling with release times to minimize the weighted number of tardy jobs
• Single machine scheduling with deadlines, release and due dates
• Single Machine Scheduling to Minimize Total Weighted Late Work

zbMATH Keywords

algorithmscomputational complexitysingle machine schedulingdue date assignmentrelease

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of generalized due date scheduling problems
• Title not available (Why is that?)

Cited In (21)

• A study of single-machine scheduling problem to maximize throughput
• Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
• Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
• A single machine scheduling with generalized and periodic due dates to minimize total deviation
• Single machine scheduling with assignable due dates to minimize maximum and total late work
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
• Batch scheduling of deteriorating reworkables
• Order acceptance and scheduling with delivery under generalized parameters
• Single Machine Scheduling to Minimize Total Late Work
• The weighted common due date single machine scheduling problem revisited
• Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates
• The problem of minimizing the weighted number of late jobs to meet strict deadlines and due processing times.
• Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
• Scheduling jobs on a single machine with periodic release date/deadline intervals
• Scheduling a single machine with multiple due dates per job
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms
• Single machine scheduling with assignable due dates
• Bicriteria scheduling for due date assignment with total weighted tardiness
• Scheduling equal processing time jobs to minimize the weighted number of late jobs

This page was built for publication: Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs

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