scientific article; zbMATH DE number 761265

zbMATH Open0826.68019MaRDI QIDQ4835595FDOQ4835595

Authors: Weizhen Mao, Rex K. Kincaid, Adam Rifkin 

Publication date: 6 June 1995

Title of this publication is not available (Why is that?)

Recommendations

• Optimal on-line algorithms for single-machine scheduling
• A class of on-line scheduling algorithms to minimize total completion time
• scientific article; zbMATH DE number 2119710
• On-line scheduling on a single machine: Minimizing the total completion time

zbMATH Keywords

on-line algorithmsjob scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cited In (10)

• Online scheduling on a single machine with grouped processing times
• Optimal on-line algorithms for single-machine scheduling
• Asymptotic analysis of an on-line algorithm for the single machine completion time problem with release dates
• Single-machine online scheduling of jobs with non-delayed processing constraint
• On-line scheduling algorithms for a batch machine with finite capacity
• Title not available (Why is that?)
• Online interval scheduling on a single machine with finite lookahead
• Title not available (Why is that?)
• Competitive analysis of a better on-line algorithm to minimize total completion time on a single-machine
• A look-ahead heuristic for scheduling jobs with release dates on a single machine

This page was built for publication:

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