scientific article
From MaRDI portal
Publication:3741388
zbMath0604.90071MaRDI QIDQ3741388
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-hardpolynomial-time algorithmsmaximum latenessmaximum tardinessbranch-and- boundcontinuously-divisible constrained nonrenewable resource
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items (7)
A survey of scheduling with controllable processing times ⋮ A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates ⋮ A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates ⋮ Single machine scheduling with total tardiness criterion and convex controllable processing times ⋮ Single machine scheduling problems with financial resource constraints: some complexity results and properties ⋮ A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
This page was built for publication:
