Bicriterion scheduling of identical processing time jobs by uniform processors

DOI10.1016/S0305-0548(97)00038-5zbMath0907.90187OpenAlexW2090427991MaRDI QIDQ1265856

M. Makhaniok, Alexander V. Tuzikov, Reinhard Männer

Publication date: 27 September 1998

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00038-5

zbMATH Keywords

polynomial time algorithmsbicriterion schedulinguniform processorsidentical processing times

Mathematics Subject Classification ID

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

Related Items (10)

Pareto-scheduling of two competing agents with their own equal processing times ⋮ Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems ⋮ Bicriteria multi-machine scheduling with equal processing times subject to release dates ⋮ Faster algorithms for bicriteria scheduling of identical jobs on uniform machines ⋮ Scheduling two agents on uniform parallel machines with~makespan and cost functions ⋮ Two-agent scheduling on uniform parallel machines with min-max criteria ⋮ Bicriterion scheduling of identical processing time jobs by uniform processors ⋮ Counting and enumeration complexity with application to multicriteria scheduling ⋮ Bicriteria scheduling of equal length jobs on uniform parallel machines ⋮ Multicriteria scheduling

Cites Work

• Unnamed Item
• Bicriterion scheduling of identical processing time jobs by uniform processors
• Scheduling identical jobs on uniform parallel machines
• Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints

This page was built for publication: Bicriterion scheduling of identical processing time jobs by uniform processors