Single-machine scheduling with an external resource

DOI10.1016/j.ejor.2020.12.045zbMath1487.90274arXiv2006.03399OpenAlexW3114751980MaRDI QIDQ2030286

Morteza Davari, Jannik Matuschke, Dirk Briskorn

Publication date: 7 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.03399

zbMATH Keywords

complexityschedulingsingle-machine schedulingpseudo-polynomial algorithmexternal resource

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

An improved algorithm for parallel machine scheduling under additional resource constraints

Cites Work

• Unnamed Item
• Unnamed Item
• An exact algorithm for minimizing resource availability costs in project scheduling
• Single machine precedence constrained scheduling is a Vertex cover problem
• One-machine generalized precedence constrained scheduling problems
• Generating lower bounds for the linear arrangement problem
• Minimizing Costs of Resource Requirements in Project Networks Subject to a Fixed Completion Time
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Algorithms for Scheduling Independent Tasks
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Optimization guided lower and upper bounds for the resource investment problem
• Reducibility among Combinatorial Problems
• Optimal Linear Ordering
• Scheduling with variable time slot costs
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems
• Optimal Sequencing of a Single Machine Subject to Precedence Constraints
• The resource renting problem subject to temporal constraints

This page was built for publication: Single-machine scheduling with an external resource