Publication:3741388
From MaRDI portal
zbMath0604.90071MaRDI QIDQ3741388
Publication date: 1986
NP-hard; polynomial-time algorithms; maximum lateness; maximum tardiness; branch-and- bound; continuously-divisible constrained nonrenewable resource
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
90C27: Combinatorial optimization
Related Items
Single machine scheduling problems with financial resource constraints: some complexity results and properties, Single machine scheduling with total tardiness criterion and convex controllable processing times, 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, 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