Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints

DOI10.1016/0020-0190(79)90076-0zbMath0426.68013OpenAlexW2024382178MaRDI QIDQ1136220

Slowinski, Roman

Publication date: 1979

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(79)90076-0

zbMATH Keywords

resource allocationopen shoppreemptive schedulingrenewable and non- renewable resources

Mathematics Subject Classification ID

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

Related Items

Preemptive scheduling with staircase and piecewise linear resource availability, Preemptive scheduling of independent jobs on parallel machines subject to financial constraints

Cites Work

• Unnamed Item
• Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
• Open Shop Scheduling to Minimize Finish Time
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey