A semi on-line algorithm for the partition problem

DOI10.1515/156939203322733327MaRDI QIDQ4809645zbMATH OpenOpenAlexFDO

Authors Eberhard Girlich, Michail M. Kovalev, V. M. Kotov

Publication date 30 August 2004

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/156939203322733327

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Semi on-line algorithms for the partition problem
• Optimal Semi-online Scheduling Algorithms on a Small Number of Machines
• Semi on-line scheduling on two parallel processors with known sum and lower bound on the size of the tasks
• Semi-on-line multiprocessor scheduling with given total processing time
• SEMI-ON-LINE PARALLEL MACHINES SCHEDULING UNDER KNOWN TOTAL AND LARGEST PROCESSING TIMES

Cited in

(2)

• scientific article; zbMATH DE number 4130003 (Why is no real title available?)
• First-Fit Algorithm for the On-Line Chain Partitioning Problem

This page was built for publication: A semi on-line algorithm for the partition problem

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