Scheduling to minimize release-time resource consumption and tardiness penalties

DOI10.1002/1520-6750(199509)42:6%3C949::AID-NAV3220420607%3E3.0.CO;2-3zbMATH Open0845.90074OpenAlexW2080338626MaRDI QIDQ4865764FDOQ4865764

Authors: Chung-Lun Li, E. C. Sewell, T. C. Edwin Cheng 

Publication date: 15 September 1996

Full work available at URL: https://doi.org/10.1002/1520-6750(199509)42:6%3C949::aid-nav3220420607%3E3.0.co;2-3

Recommendations

• Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption
• Minimizing total completion time for preemptive scheduling with release dates and deadline constraints
• Scheduling with controllable release dates and processing times: total completion time minimization
• Minimizing the number of tardy job units under release time constraints
• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• Scheduling to minimize the total compression and late costs
• scientific article
• scientific article; zbMATH DE number 3904315
• Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs
• Scheduling with controllable release dates and processing times: Makespan minimization

zbMATH Keywords

single-machinecommon due-datepseudo-polynomial time algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Algorithms for Scheduling Independent Tasks

Cited In (19)

• Scheduling with controllable release dates and processing times: Makespan minimization
• Scheduling with controllable release dates and processing times: total completion time minimization
• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• Single machine batch scheduling with deadlines and resource dependent processing times
• Single machine scheduling with resource dependent release times and processing times
• A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling
• Single machine batch scheduling with jointly compressible setup and processing times.
• Matchup Scheduling with Multiple Resources, Release Dates and Disruptions
• An exact approach to early/tardy scheduling with release dates
• 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
• 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 group scheduling with resource dependent setup and processing times
• On common properties of two scheduling problems with different objective criteria
• Single-machine scheduling with learning considerations
• Group scheduling with controllable setup and processing times: minimizing total weighted completion time
• Single machine earliness-tardiness scheduling with resource-dependent release dates
• Scheduling to minimize the total compression and late costs

This page was built for publication: Scheduling to minimize release-time resource consumption and tardiness penalties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4865764)