Semi-on-line scheduling problems for maximizing the minimum machine completion time

DOI10.1007/BF02669690MaRDI QIDQ5931905zbMATH OpenFDO

Authors Yong He

Publication date 6 May 2001

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02669690

zbMATH Keywords

scheduling problems

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• A simple semi on-line algorithm for \(\mathrm{P}2//C_{\max}\) with a buffer
• Analysis of Greedy Solutions for a Replacement Part Sequencing Problem
• Bounds for Certain Multiprocessing Anomalies
• scientific article; zbMATH DE number 4130003 (Why is no real title available?)
• On-line machine covering
• Ordinal algorithms for parallel machine scheduling
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• The exact LPT-bound for maximizing the minimum completion time

Cited in

(16)

• Ordinal on-line scheduling for maximizing the minimum machine completion time
• Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
• Preemptive semi-online algorithms for parallel machine scheduling with known total size
• Semi-online scheduling: a survey
• Semi-online machine covering on two hierarchical machines with known total size of low-hierarchy jobs
• scientific article; zbMATH DE number 5583893 (Why is no real title available?)
• A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs
• Semi-on-line scheduling with ordinal data on two uniform machines
• Parallel solutions for ordinal scheduling with a small number of machines
• A modified list scheduling algorithm for the online hierarchical load balancing problem with bounded processing times
• Semi-online machine covering problem on three hierarchical machines with bounded processing times
• Makespan minimization for ordinal cardinality constrained scheduling
• Semi-online scheduling with look-ahead
• Variants and objectives for ordinal scheduling
• Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines
• Optimal semi-online algorithms for machine covering

This page was built for publication: Semi-on-line scheduling problems for maximizing the minimum machine completion time

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