Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines

DOI10.1007/978-3-319-89920-6_78zbMath1397.90199OpenAlexW2805007485MaRDI QIDQ4685818

Marcin Żurowski

Publication date: 9 October 2018

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

Full work available at URL: https://doi.org/10.1007/978-3-319-89920-6_78

zbMATH Keywords

schedulingmaximum completion timelearning effectparallel identical machinesjob preemption

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Scheduling with time-changing effects and rate-modifying activities
• Time-dependent scheduling
• A note on scheduling on a single processor with speed dependent on a number of executed jobs
• Integer preemptive scheduling on parallel machines
• Scheduling with Deadlines and Loss Functions
• Multiagent Scheduling
• Scheduling problems with a learning effect

This page was built for publication: Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines