Minimizing the number of tardy jobs in single machine sequencing

DOI10.1016/0012-365X(93)90336-RzbMATH Open0785.68010OpenAlexW2019760740MaRDI QIDQ686166FDOQ686166

Authors Ahmad H. Sharary, Nejib Zaguia

Publication date 17 April 1994

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(93)90336-r

zbMATH Keywords

schedulingprecedence constraints

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Combinatorics of partially ordered sets (06A07)

Recommendations

• Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
• Minimizing Total Tardiness on a Single Machine with Precedence Constraints
• On minimizing the sum of \(k\) tardinesses
• Minimizing the number of tardy job units under release time constraints
• An exact method to minimize the number of tardy jobs in single machine scheduling

Cites work

• scientific article; zbMATH DE number 3883928 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3430360 (Why is no real title available?)
• Finding the largest suborder of fixed width
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Scheduling Tasks with Nonuniform Deadlines on Two Processors

Cited in

(8)

• Finding the largest suborder of fixed width
• Sorting common operations to minimize the number of tardy jobs
• A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
• A survey of single machine scheduling to minimize weighted number of tardy jobs
• scientific article; zbMATH DE number 57503 (Why is no real title available?)
• Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
• WORST-CASE ANALYSIS OF INDEXING RULES FOR SINGLE MACHINE SEQUENCING
• MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING

This page was built for publication: Minimizing the number of tardy jobs in single machine sequencing

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