scientific article; zbMATH DE number 3848954

MaRDI QIDQ3318519zbMATH OpenFDO

Authors Vyacheslav Tanaev, V. S. Gordon

Publication date 1983

zbMATH Keywords

due- datesexistence of the optimal scheduleone-machine, n-job scheduling problempolynomial time algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
• The problem of minimizing the weighted number of late jobs to meet strict deadlines and due processing times.
• scientific article; zbMATH DE number 4217092
• Algorithms for a class of single-machine weighted tardiness and earliness problems

Cited in

(5)

• Vyacheslav Tanaev: contributions to scheduling and related areas
• Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
• Polynomial algorithms of solution for some problems of construction of the timetables of a device for demands with waiting
• A locally optimal insertion heuristic for a one-machine scheduling problem
• scientific article; zbMATH DE number 4025149 (Why is no real title available?)

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 Q3318519)