On common properties of two scheduling problems with different objective criteria

MaRDI QIDQ3632076zbMATHFDO

Authors Nodari Vakhania

Publication date 23 June 2009

zbMATH Keywords

scheduling algorithmstime complexitydue-date

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On the general solution for a class of early/tardy problems
• Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine
• Scheduling to minimize release-time resource consumption and tardiness penalties
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• scientific article; zbMATH DE number 721865

This page was built for publication: On common properties of two scheduling problems with different objective criteria

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