Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
DOI10.1016/S0167-6377(96)00035-1zbMATH Open0874.90105OpenAlexW2005924883WikidataQ127646641 ScholiaQ127646641MaRDI QIDQ1362988FDOQ1362988
Authors: Chung-Lun Li, T. C. Edwin Cheng, Zhi-Long Chen 
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
Recommendations
- Single-machine scheduling with trade-off between number of tardy jobs and compression cost
- Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
- Single Machine Scheduling with Deadlines to Minimize the Weighted Number of Tardy Jobs
- scientific article; zbMATH DE number 825147
- A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine
- Single Machine Stochastic Scheduling: Minimizing the Number of Tardy Jobs
- Single-machine scheduling to minimize earliness and number of tardy jobs
- A note on the single machine scheduling to minimize the number of tardy jobs with deadlines
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
resource allocationNP-hardnesssequencingsingle-machine schedulingpseudo-polynomial-time dynamic programming algorithmtime-cost trade-offs
Cites Work
- Title not available (Why is that?)
- A survey of results for sequencing problems with controllable processing times
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- A bicriterion approach to time/cost trade-offs in sequencing
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
Cited In (20)
- Bi-criteria and tri-criteria analysis to minimize maximum lateness makespan and resource consumption for scheduling a single machine
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Scheduling two projects with controllable processing times in a single-machine environment
- Single-machine scheduling with trade-off between number of tardy jobs and compression cost
- A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
- Scheduling to tradeoff between the number and the length of accepted jobs
- Minimizing completion time variance with compressible processing times
- A survey of scheduling with controllable processing times
- Two‐agent scheduling with linear resource‐dependent processing times
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
- Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect
- A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Single machine scheduling with discretely controllable processing times
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
- Minimizing total tardiness on a single machine with controllable processing times
- Single-machine scheduling of multiple projects with controllable processing times
- Multicriteria scheduling
- Inverse interval scheduling via reduction on a single machine
- A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine
This page was built for publication: Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362988)
