Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times

DOI10.1016/S0898-1221(02)00115-3MaRDI QIDQ1609082zbMATH OpenFDO

Authors Zhiyi Tan, Yong He

Publication date 15 August 2002

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0898-1221(02)00115-3

zbMATH Keywords

parallel machine schedulingordinal algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Parallel algorithms in computer science (68W10)

Recommendations

• Ordinal algorithms for parallel machine scheduling
• The on-line preemptive scheduling on parallel machines which have nonsimultaneous machine available times
• scientific article; zbMATH DE number 1810114
• Ordinal on-line scheduling for maximizing the minimum machine completion time
• Parallel machines scheduling with nonsimultaneous machine available time

Cites work

• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• A note on parallel machine scheduling with non-simultaneous machine available time
• Bin packing using semi-ordinal data
• On-line bin-stretching
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Ordinal algorithms for packing with target center of gravity
• Ordinal algorithms for parallel machine scheduling
• Parallel machines scheduling with nonsimultaneous machine available time
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• Semi-online scheduling with decreasing job sizes
• The optimal on-line parallel machine scheduling

Cited in

(7)

• Semi-online scheduling jobs with tightly-grouped processing times on three identical machines
• Semi-on-line problems on two identical machines with combined partial information
• Ordinal scheduling problem and its asymptotically optimal algorithms on parallel machine system
• Parallel solutions for ordinal scheduling with a small number of machines
• \(\kappa\)-partitioning problems for maximizing the minimum load
• Makespan minimization for ordinal cardinality constrained scheduling
• scientific article; zbMATH DE number 1810114 (Why is no real title available?)

This page was built for publication: Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times

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