Scheduling on machines with variable service rates

DOI10.1016/0305-0548(87)90066-9zbMath0629.90049OpenAlexW1992076817MaRDI QIDQ1094326

Igal Adiri, Zvi Yehudai

Publication date: 1987

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(87)90066-9

zbMATH Keywords

parallel machinessingle machineminimum sum of completion timescyclic series of service factorsminimum maximum latenessminimum number of tardy jobsminimum schedule lengthminimum sum of tardiness times

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (6)

Scheduling on machines with variable service rates ⋮ Streaming algorithms for multitasking scheduling with shared processing ⋮ Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity ⋮ Unrelated parallel machine scheduling problem with special controllable processing times and setups ⋮ A unified view of parallel machine scheduling with interdependent processing rates ⋮ Machine scheduling with a rate-modifying activity

Cites Work

• Scheduling on machines with variable service rates
• Sequencing independent jobs with a single resource
• Exact and Approximate Algorithms for Scheduling Nonidentical Processors
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling on machines with variable service rates