scientific article; zbMATH DE number 89399
From MaRDI portal
Publication:4016820
Recommendations
- Minimizing the number of late jobs on unrelated machines
- Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs
- Minimizing mean flow time with release time constraint
- HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS
- A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
Cited in
(16)- Is a unit-job shop not easier than identical parallel machines?
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- A note on the maximum number of on-time jobs on parallel identical machines.
- Preemptive scheduling of equal-length jobs to maximize weighted throughput.
- A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- Branch less, cut more and minimize the number of late equal-length jobs on identical machines
- A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem
- Minimizing the weighted number of tardy jobs on multiple machines: a review
- Subdivision-based digital geometry processing as a fundamental building block of digital manufacturing
- Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
- HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS
- Scheduling to minimize release-time resource consumption and tardiness penalties
- The bottleneck transportation problem with auxiliary resources
- Minimizing the number of late jobs on unrelated machines
- Minimizing mean flow time with release time constraint
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 Q4016820)
