scientific article; zbMATH DE number 1094690

Publication date: 4 December 1997

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (34)

Lower bounds for on-line single-machine scheduling. ⋮ Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time ⋮ Best-Possible Online Algorithms for Single Machine Scheduling to Minimize the Maximum Weighted Completion Time ⋮ ON ONLINE SCHEDULING JOBS WITH RESTART TO MAXIMIZE THE NUMBER OF JOBS COMPLETED TIME ON A SINGLE MACHINE ⋮ A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection ⋮ An on-line scheduling problem of parallel machines with common maintenance time ⋮ Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling ⋮ Online Single Machine Scheduling to Minimize the Maximum Starting Time ⋮ An optimal online algorithm for single machine scheduling to minimize total general completion time ⋮ Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs ⋮ Greed Works—Online Algorithms for Unrelated Machine Stochastic Scheduling ⋮ Optimal algorithms for online single machine scheduling with deteriorating jobs ⋮ Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost ⋮ An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time ⋮ Online scheduling with linear deteriorating jobs to minimize the total weighted completion time ⋮ On-line scheduling on a single machine: Maximizing the number of early jobs ⋮ On-line scheduling to minimize average completion time revisited. ⋮ Online batch scheduling on parallel machines with delivery times ⋮ Applying ``peeling onion approach for competitive analysis in online scheduling with rejection ⋮ On-line single-server dial-a-ride problems ⋮ An optimal online algorithm for scheduling two machines with release times ⋮ Online Parallel-Machine Scheduling in KRT Environment to Minimize Total Weighted Completion Time ⋮ LPT online strategy for parallel-machine scheduling with kind release times ⋮ On-line scheduling of parallel machines to minimize total completion times ⋮ LP-based online scheduling: From single to parallel machines ⋮ A class of on-line scheduling algorithms to minimize total completion time ⋮ Online scheduling to minimize total weighted (modified) earliness and tardiness cost ⋮ Online scheduling to minimize modified total tardiness with an availability constraint ⋮ Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead ⋮ An optimal online algorithm for single-processor scheduling problem with learning effect ⋮ Randomized selection algorithm for online stochastic unrelated machines scheduling ⋮ Restarts can help in the on-line minimization of the maximum delivery time on a single machine ⋮ Online Scheduling on Two Parallel Machines with Release Times and Delivery Times ⋮ Randomized algorithms for on-line scheduling problems: How low can't you go?

This page was built for publication: