Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption

DOI10.1016/0895-7177(94)90206-2zbMath0810.90068OpenAlexW2059689559MaRDI QIDQ1341400

Adam Janiak, Chung-Lun Li

Publication date: 11 January 1995

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(94)90206-2

zbMATH Keywords

resource allocationresource consumptionrelease datessingle-machinestrongly NP-hard

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint ⋮ Single machine scheduling problems with resource dependent release times ⋮ Scheduling with controllable release dates and processing times: Makespan minimization ⋮ Scheduling with controllable release dates and processing times: total completion time minimization ⋮ A scheduling problem with job values given as a power function of their completion times ⋮ SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN ⋮ On minimizing resource consumption with constraints on the makespan and the total completion time ⋮ Single machine earliness-tardiness scheduling with resource-dependent release dates

Cites Work

• Unnamed Item
• Time-optimal control in a single machine problem with resource constraints
• Single machine scheduling problem with a common deadline and resource dependent release dates
• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• Scheduling to minimize release-time resource consumption and tardiness penalties