scientific article; zbMATH DE number 1235242

MaRDI QIDQ4223483zbMATH OpenFDO

Authors Adrianus Petrus Antonius Vestjens

Publication date 4 January 1999

zbMATH Keywords

randomizationlower boundsmaximum latenessmakespanparallel machine schedulingtotal completion timesingle-machine schedulingpolynomial-time heuristiccomplexity of job insertionon-line setting

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Optimal on-line algorithms for single-machine scheduling
• On-line scheduling of parallel jobs on two machines
• New algorithms for an ancient scheduling problem.
• Scheduling Parallel Machines On-Line
• A class of on-line scheduling algorithms to minimize total completion time

Cited in

(14)

• On-line and off-line preemptive two-machine job shop scheduling
• The one machine scheduling problem: insertion of a job under the real-time constraint
• A note on ``An optimal online algorithm for single machine scheduling to minimize total general completion time
• On-line two-machine open shop scheduling with time lags
• scientific article; zbMATH DE number 1082109 (Why is no real title available?)
• The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
• On-line scheduling of small open shops
• Optimal on-line algorithms for single-machine scheduling
• An optimal online algorithm for two-machine open shop preemptive scheduling with bounded processing times
• Single-machine online scheduling of jobs with non-delayed processing constraint
• On-line multi-threaded scheduling
• New trends in machine scheduling
• On-Line Scheduling In Assembly Processes
• On-line scheduling with general machine cost functions

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 Q4223483)