Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times

DOI10.1016/S0898-1221(02)00115-3zbMath1002.68200MaRDI QIDQ1609082

Yong He, Zhiyi Tan

Publication date: 15 August 2002

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

zbMATH Keywords

parallel machine schedulingordinal algorithms

Mathematics Subject Classification ID

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

Related Items (4)

\(\kappa\)-partitioning problems for maximizing the minimum load ⋮ Parallel solutions for ordinal scheduling with a small number of machines ⋮ 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

Cites Work

• Unnamed Item
• Parallel machines scheduling with nonsimultaneous machine available time
• Semi on-line algorithms for the partition problem
• Semi on-line scheduling on two identical machines
• The optimal on-line parallel machine scheduling
• Ordinal algorithms for packing with target center of gravity
• Ordinal algorithms for parallel machine scheduling
• A note on parallel machine scheduling with non-simultaneous machine available time
• Bin packing using semi-ordinal data
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Semi-online scheduling with decreasing job sizes
• On-line bin-stretching

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