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

DOI10.1016/S0020-0190(98)00153-7MaRDI QIDQ293435zbMATH OpenFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 4172724 (Why is no real title available?)
• scientific article; zbMATH DE number 44978 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the complexity of generalized due date scheduling problems

Cited in

(22)

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

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)