Scheduling on semi-identical processors

DOI10.1007/BF01920917MaRDI QIDQ3343751zbMATH OpenOpenAlexFDO

Authors 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

preemptive scheduleparallel processorsdifferent intervals of availability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling Independent Tasks with Deadlines on Semi-identical Processors
• Scheduling preemptable tasks on parallel processors with limited availability
• Scheduling multiprocessor tasks on parallel processors with limited availability.
• Scheduling independent multiprocessor tasks
• scientific article; zbMATH DE number 2080263

Cites work

• Preemptive Scheduling of Uniform Processor Systems
• Preemptive Scheduling with Due Dates
• Scheduling with deadlines and loss functions
• Time bounds for selection

Cited in

(28)

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

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

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