scientific article; zbMATH DE number 2219122
From MaRDI portal
Publication:5697786
Recommendations
- Single machine lot scheduling to minimize the total weighted (discounted) completion time
- A note on the single-machine scheduling problem with minimum weighted completion time and maximum allowable tardiness
- Two scheduling problems of minimizing the maximum weighted completion time
- NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
- Single machine scheduling problem with interval processing times to minimize mean weighted completion time
- Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations
- Scheduling of a single machine to minimize total weighted completion time subject to release dates
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- A semi-online algorithm for solving the single machine scheduling problem to minimize total weighted completion time with discounted factor
- scientific article; zbMATH DE number 3858822
Cited in
(6)- Single machine lot scheduling to minimize the total weighted (discounted) completion time
- A semi-online algorithm for solving the single machine scheduling problem to minimize total weighted completion time with discounted factor
- Study on single machine scheduling problem based on general time-and-position dependent jobs processing time
- Inverse problems of single machine scheduling on processing times of jobs
- Scheduling problems with a weight-modifying-activity
- NP-hardness of the single-variable-resource scheduling problem to minimize the total weighted completion time
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5697786)
