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

DOI10.1134/S0005117910100073zbMath1203.93129OpenAlexW2041691077MaRDI QIDQ612212

Alexander A. Lazarev, A. G. Kvaratskhelia

Publication date: 3 January 2011

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117910100073

zbMATH Keywords

single machineoptimal scheduleweighted completion time

Mathematics Subject Classification ID

Applications of optimal control and differential games (49N90) Control/observation systems involving computers (process control, etc.) (93C83) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

An exact algorithm for the preemptive single machine scheduling of equal-length jobs

Cites Work

• Scheduling equal-length jobs on identical parallel machines
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: 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