scientific article
From MaRDI portal
Publication:3775317
zbMath0635.90048MaRDI QIDQ3775317
Publication date: 1987
Full work available at URL: https://eudml.org/doc/28806
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
maximum completion timepolynomial-time algorithmsmaximum latenessone-machine schedulingweighted sum of completion timescontinuously-divisible constrained nonrenewable resourceno precedence constraints
Related Items (23)
Convex resource allocation for minimizing the makespan in a single machine with job release dates ⋮ Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine ⋮ Minimizing the total weighted flow time in a single machine with controllable processing times ⋮ Single machine batch scheduling to minimize total completion time and resource consumption costs ⋮ Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption ⋮ A survey of scheduling with controllable processing times ⋮ Single machine scheduling problem with controllable processing times and resource dependent release times ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates ⋮ Scheduling with due date assignment under special conditions on job processing ⋮ Single machine scheduling problem with a common deadline and resource dependent release dates ⋮ The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times ⋮ Single-machine scheduling with machine unavailability periods and resource dependent processing times ⋮ A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine ⋮ Resource cost aware scheduling ⋮ A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates ⋮ Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity ⋮ Just-in-time scheduling with controllable processing times on parallel machines ⋮ Parallel machine scheduling with a convex resource consumption function ⋮ A unified approach for scheduling with convex resource consumption functions using positional penalties ⋮ Scheduling two agents with controllable processing times ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling ⋮ Optimal due date assignment and resource allocation in a group technology scheduling environment
Cites Work
This page was built for publication:
