Scheduling to minimize release-time resource consumption and tardiness penalties

DOI<949::AID-NAV3220420607>3.0.CO;2-3 10.1002/1520-6750(199509)42:6<949::AID-NAV3220420607>3.0.CO;2-3zbMath0845.90074OpenAlexW2080338626MaRDI QIDQ4865764

Cheng, T. C. Edwin, Chung-Lun Li, Edward C. Sewell

Publication date: 15 September 1996

Full work available at URL: https://doi.org/10.1002/1520-6750(199509)42:6<949::aid-nav3220420607>3.0.co;2-3

zbMATH Keywords

single-machinecommon due-datepseudo-polynomial time algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption ⋮ Single machine scheduling problems with resource dependent release times ⋮ Single-machine scheduling with learning considerations ⋮ Single machine batch scheduling with deadlines and resource dependent processing times ⋮ Scheduling with controllable release dates and processing times: Makespan minimization ⋮ Scheduling with controllable release dates and processing times: total completion time minimization ⋮ Single machine batch scheduling with jointly compressible setup and processing times. ⋮ Single machine scheduling with resource dependent release times and processing times ⋮ Single machine group scheduling with resource dependent setup and processing times ⋮ Group scheduling with controllable setup and processing times: minimizing total weighted completion time ⋮ Single machine batch scheduling with resource dependent setup and processing times ⋮ 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

• Algorithms for Scheduling Independent Tasks