scientific article; zbMATH DE number 1094690
From MaRDI portal
Publication:4368485
zbMATH Open0941.68515MaRDI QIDQ4368485FDOQ4368485
Authors: Arjen P. A. Vestjens 
Publication date: 4 December 1997
Title of this publication is not available (Why is that?)
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (34)
- An on-line scheduling problem of parallel machines with common maintenance time
- LPT online strategy for parallel-machine scheduling with kind release times
- ON ONLINE SCHEDULING JOBS WITH RESTART TO MAXIMIZE THE NUMBER OF JOBS COMPLETED TIME ON A SINGLE MACHINE
- On-line single-server dial-a-ride problems
- Randomized algorithms for on-line scheduling problems: How low can't you go?
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs
- On-line scheduling on a single machine: Maximizing the number of early jobs
- Greed works -- online algorithms for unrelated machine stochastic scheduling
- Optimal algorithms for online single machine scheduling with deteriorating jobs
- Applying ``peeling onion approach for competitive analysis in online scheduling with rejection
- Online single machine scheduling to minimize the maximum starting time
- Restarts can help in the on-line minimization of the maximum delivery time on a single machine
- A class of on-line scheduling algorithms to minimize total completion time
- Online scheduling on two parallel machines with release times and delivery times
- Lower bounds for on-line single-machine scheduling.
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection
- Online scheduling to minimize modified total tardiness with an availability constraint
- An optimal online algorithm for scheduling two machines with release times
- Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling
- On-line scheduling to minimize average completion time revisited.
- Online scheduling on \(m\) uniform machines to minimize total (weighted) completion time
- Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
- On-line scheduling of parallel machines to minimize total completion times
- LP-based online scheduling: From single to parallel machines
- Online scheduling of unit length jobs on a batching machine to maximize the number of early jobs with lookahead
- Online batch scheduling on parallel machines with delivery times
- Online scheduling to minimize total weighted (modified) earliness and tardiness cost
- An optimal online algorithm for single-processor scheduling problem with learning effect
- Randomized selection algorithm for online stochastic unrelated machines scheduling
- An improved 2.11-competitive algorithm for online scheduling on parallel machines to minimize total weighted completion time
- Online parallel-machine scheduling in KRT environment to minimize total weighted completion time
- Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time
- An optimal online algorithm for single machine scheduling to minimize total general completion time
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 Q4368485)
