A study of single-machine scheduling problem to maximize throughput
From MaRDI portal
Recommendations
- Single-machine scheduling with release times and tails
- Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs
- Single Machine Scheduling to Minimize Total Late Work
- Scheduling jobs with equal processing times on a single machine: minimizing maximum lateness and makespan
- Minimization of the maximal lateness for a single machine
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A better algorithm for sequencing with release and delivery times on identical machines
- A note on scheduling equal-length jobs to maximize throughput
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Branch less, cut more and minimize the number of late equal-length jobs on identical machines
- Complexity results for single-machine problems with positive finish-start time-lags
- Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
- Parallel machine problems with equal processing times: a survey
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
Cited in
(5)
This page was built for publication: A study of single-machine scheduling problem to maximize throughput
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q398860)
