Scheduling on semi-identical processors

DOI10.1007/BF01920917zbMath0551.90044OpenAlexW1983471329MaRDI QIDQ3343751

Günter Schmidt

Publication date: 1984

Published in: Zeitschrift für Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01920917

zbMATH Keywords

parallel processorspreemptive scheduledifferent intervals of availability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (24)

Makespan minimization for two parallel machines with an availability constraint ⋮ Multiprocessor Jobs, Preemptive Schedules, and One-Competitive Online Algorithms ⋮ Nearly on line scheduling of preemptive independent tasks ⋮ Scheduling jobs in open shops with limited machine availability ⋮ Parallel machine scheduling with machine availability and eligibility constraints ⋮ A scheduling problem with three competing agents ⋮ Two meta-heuristic algorithms for solving multi-objective flexible job-shop scheduling with parallel machine and maintenance constraints ⋮ Scheduling multiprocessor tasks on parallel processors with limited availability. ⋮ Scheduling jobs and maintenance activities on parallel machines ⋮ Single-machine scheduling with maintenance activities and rejection ⋮ Scheduling with limited machine availability ⋮ Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan ⋮ Multi-machine scheduling with deteriorating jobs and scheduled maintenance ⋮ Scheduling with unexpected machine breakdowns ⋮ Two-machine flow shops with limited machine availability ⋮ Single-machine scheduling with maintenance and repair rate-modifying activities ⋮ Metaheuristics to solve a tasks scheduling problem in parallel identical machines with unavailability periods ⋮ Minimizing the sum of job completion times on capacitated two-parallel machines ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Scheduling independent two processor tasks on a uniform duo-processor system ⋮ Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times ⋮ Two-machine flowshop scheduling with availability constraints ⋮ Machine scheduling with a rate-modifying activity ⋮ Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints

Cites Work

• Time bounds for selection
• Scheduling with Deadlines and Loss Functions
• Preemptive Scheduling with Due Dates
• Preemptive Scheduling of Uniform Processor Systems

This page was built for publication: Scheduling on semi-identical processors