Single-machine scheduling with trade-off between number of tardy jobs and resource allocation

DOI10.1016/S0167-6377(96)00035-1zbMath0874.90105OpenAlexW2005924883WikidataQ127646641 ScholiaQ127646641MaRDI QIDQ1362988

Chung-Lun Li, Zhi-Long Chen, Cheng, T. C. Edwin

Publication date: 7 August 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(96)00035-1

zbMATH Keywords

single-machine schedulingresource allocationsequencingNP-hardnesspseudo-polynomial-time dynamic programming algorithmtime-cost trade-offs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (16)

Single-machine scheduling with trade-off between number of tardy jobs and compression cost ⋮ A survey of scheduling with controllable processing times ⋮ Inverse interval scheduling via reduction on a single machine ⋮ Single machine scheduling with discretely controllable processing times ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ A hybrid heuristic approach to minimize number of tardy jobs in group technology systems ⋮ Two‐agent scheduling with linear resource‐dependent processing times ⋮ Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect ⋮ Single-machine scheduling of multiple projects with controllable processing times ⋮ Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models ⋮ Minimizing completion time variance with compressible processing times ⋮ Minimizing total tardiness on a single machine with controllable processing times ⋮ Multicriteria scheduling ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems

Cites Work

• Unnamed Item
• A survey of results for sequencing problems with controllable processing times
• A bicriterion approach to time/cost trade-offs in sequencing
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs

This page was built for publication: Single-machine scheduling with trade-off between number of tardy jobs and resource allocation