scientific article; zbMATH DE number 434689

MaRDI QIDQ3139525zbMATH OpenFDO

Authors C. W. Ng, Gilbert H. Young

Publication date 30 May 1994

zbMATH Keywords

polynomial time algorithmsingle processorcommon due date\(NP\)-hardnonpreemptive schedulemaximal weighted earliness and tardinessscheduling independent jobs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Scheduling to minimize weighted earliness and tardiness about a common due-date
• Single machine weighted earliness-tardiness penalty problem with a common due date
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs

Cited in

(7)

• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• On Optimal Common Due-Date Determination
• Scheduling to minimize weighted earliness and tardiness about a common due-date
• Single machine weighted earliness-tardiness penalty problem with a common due date
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models
• Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties

This page was built for publication:

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