Minimizing the number of tardy jobs in single machine sequencing

DOI10.1016/0012-365X(93)90336-RzbMath0785.68010OpenAlexW2019760740MaRDI QIDQ686166

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

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

Related Items (4)

A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ Finding the largest suborder of fixed width ⋮ A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem ⋮ Minimizing the number of tardy jobs with precedence constraints and agreeable due dates

Cites Work

• Finding the largest suborder of fixed width
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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