Polynomial algorithms for single machine scheduling problems with financial constraints

DOI10.1016/S0167-6377(97)00007-2zbMath0885.90063OpenAlexW2046410449MaRDI QIDQ1371954

Jinxing Xie

Publication date: 4 May 1998

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

Full work available at URL: https://doi.org/10.1016/s0167-6377(97)00007-2

zbMATH Keywords

polynomial algorithmssingle machine schedulinglargest processing timemultiple financial resource constraintstwo machine flow shop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (11)

Flow shop non-idle scheduling and resource-constrained scheduling ⋮ On relocation problems with multiple identical working crews ⋮ A multivariate complexity analysis of the material consumption scheduling problem ⋮ Approximation schemes for parallel machine scheduling with non-renewable resources ⋮ Tight complexity analysis of the relocation problem with arbitrary release dates ⋮ A PTAS for a resource scheduling problem with arbitrary number of parallel machines ⋮ Minimizing the total weighted completion time in the relocation problem ⋮ Resource-constrained flowshop scheduling with separate resource recycling operations ⋮ On the relocation problem with a second working crew for resource recycling ⋮ On single machine scheduling with resource constraint ⋮ Minimizing total weighted completion time on a single machine subject to non-renewable resource constraints

Cites Work

• Preemptive scheduling of independent jobs on parallel machines subject to financial constraints
• Scheduling subject to nonrenewable-resource constraints
• Optimal two- and three-stage production schedules with setup times included
• Scheduling under a Non-renewable Resource Constraint

This page was built for publication: Polynomial algorithms for single machine scheduling problems with financial constraints