Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times
From MaRDI portal
Publication:1609082
DOI10.1016/S0898-1221(02)00115-3zbMATH Open1002.68200MaRDI QIDQ1609082FDOQ1609082
Publication date: 15 August 2002
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
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
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)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Semi on-line scheduling on two identical machines
- The optimal on-line parallel machine scheduling
- Semi on-line algorithms for the partition problem
- Ordinal algorithms for parallel machine scheduling
- Semi-online scheduling with decreasing job sizes
- Parallel machines scheduling with nonsimultaneous machine available time
- On-line bin-stretching
- A note on parallel machine scheduling with non-simultaneous machine available time
- Ordinal algorithms for packing with target center of gravity
- Bin packing using semi-ordinal data
Cited In (5)
- 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
- Parallel solutions for ordinal scheduling with a small number of machines
- \(\kappa\)-partitioning problems for maximizing the minimum load
- Title not available (Why is that?)
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)