Uniform machine scheduling of unit-time jobs subject to resource constraints

DOI10.1016/S0166-218X(97)00138-8zbMath0908.90167OpenAlexW2093113778MaRDI QIDQ1392579

Mikhail Y. Kovalyov, Yakov M. Shafransky

Publication date: 28 July 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

uniform machinesresource-constrained schedulingmaximum job completion timeunit-time jobs

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (6)

No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ A scheduling problem with job values given as a power function of their completion times ⋮ Production, maintenance and resource scheduling: a review ⋮ A polynomial algorithm for lot-size scheduling of two type tasks. ⋮ Parallel machine scheduling with additional resources: notation, classification, models and solution methods

Cites Work

• Scientific school of Academician V. S. Tanaev: results on the scheduling theory
• Scheduling subject to resource constraints: Classification and complexity
• Scheduling identical jobs on uniform parallel machines
• Algorithms for two bottleneck optimization problems
• Unnamed Item

This page was built for publication: Uniform machine scheduling of unit-time jobs subject to resource constraints