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

DOI10.1007/BF02669690zbMath0973.68016MaRDI QIDQ5931905

Yong He

Publication date: 6 May 2001

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

zbMATH Keywords

scheduling problems

Mathematics Subject Classification ID

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

Related Items (9)

Semi on-line scheduling problem for maximizing the minimum machine completion time on two uniform machines ⋮ Optimal semi-online algorithms for machine covering ⋮ Semi-online scheduling: a survey ⋮ Parallel solutions for ordinal scheduling with a small number of machines ⋮ Semi-online Machine Covering on Two Hierarchical Machines with Known Total Size of Low-Hierarchy Jobs ⋮ Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data ⋮ Semi-on-line scheduling with ordinal data on two uniform machines ⋮ Preemptive semi-online algorithms for parallel machine scheduling with known total size ⋮ A heuristic MBLS algorithm for the two semi-online parallel machine scheduling problems with deterioration jobs

Cites Work

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

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