Ordinal algorithms for parallel machine scheduling

DOI10.1016/0167-6377(95)00058-5zbMath0855.90070OpenAlexW2024141097MaRDI QIDQ1919194

André van Vliet, Wei-Ping Liu, Jeffrey B. Sidney

Publication date: 3 February 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://repub.eur.nl/pub/71567

zbMATH Keywords

heuristic algorithmsidentical parallel machinesworst case performanceminimization of maximum completion time

Mathematics Subject Classification ID

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

Related Items (23)

A survey on makespan minimization in semi-online environments ⋮ \(\kappa\)-partitioning problems for maximizing the minimum load ⋮ Optimal preemptive semi-online scheduling on two uniform processors ⋮ Ordinal algorithms for parallel machine scheduling ⋮ Semi-online scheduling for jobs with release times ⋮ Semi-online scheduling: a survey ⋮ Parallel solutions for ordinal scheduling with a small number of machines ⋮ Semi-online scheduling with machine cost. ⋮ Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates ⋮ Optimal semi-online algorithms for preemptive scheduling problems with inexact partial information ⋮ List scheduling for jobs with arbitrary release times and similar lengths ⋮ Semi-online scheduling with decreasing job sizes ⋮ Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines ⋮ Semi-on-line scheduling problems for maximizing the minimum machine completion time ⋮ Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data ⋮ Optimal semi-online preemptive algorithms for machine covering on two uniform machines ⋮ Semi-on-line scheduling with ordinal data on two uniform machines ⋮ Randomized on-line scheduling similar jobs to minimize makespan on two identical processors ⋮ Semi on-line algorithms for the partition problem ⋮ Bin packing using semi-ordinal data ⋮ Semi-online scheduling jobs with tightly-grouped processing times on three identical machines ⋮ Ordinal algorithms for parallel machine scheduling with nonsimultaneous machine available times ⋮ Semi-on-line problems on two identical machines with combined partial information

Cites Work

• No-wait flow shop scheduling with large lot sizes
• Ordinal algorithms for packing with target center of gravity
• Ordinal algorithms for parallel machine scheduling
• Bin packing using semi-ordinal data
• Bounds on Multiprocessing Timing Anomalies
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Ordinal algorithms for parallel machine scheduling