Approximate sequencing for variable length tasks.

DOI10.1016/S0304-3975(02)00091-9MaRDI QIDQ1401212zbMATH OpenOpenAlexFDO

Authors Xiaotie Deng, Lusheng Wang, Mao-Cheng Cai

Publication date 17 August 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(02)00091-9

zbMATH Keywords

variable length sequencing problem

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Nonnumerical algorithms (68W05)

Recommendations

• Scheduling tasks with sequence-dependent processing times
• scientific article; zbMATH DE number 3991266
• Publication:3481475
• Sequencing jobs with random processing times to minimize weighted completion time variance
• On parallel versus sequential approximation
• A new sequential approximation method
• Some comments on sequencing with controllable processing times
• Continuation methods for approximate large scale object sequencing

Cites work

• Exploring an unknown graph
• Exploring Unknown Environments
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)

Cited in

(4)

• On polynomial-time approximation algorithms for the variable length scheduling problem.
• Approximate and dynamic rank aggregation
• scientific article; zbMATH DE number 1670529 (Why is no real title available?)
• Efficient web searching using temporal factors

This page was built for publication: Approximate sequencing for variable length tasks.

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