Minimizing Mean Flow Time With Release Time and Deadline Constraints
From MaRDI portal
Publication:4033756
Recommendations
- Minimizing mean flow time with release time constraint
- Efficient heuristics to minimize total flow time with release dates
- The complexity of mean flow time scheduling problems with release times
- Mean flow time minimization with given bounds of processing times
- scientific article; zbMATH DE number 91757
- Minimizing Schedule Length Subject to Minimum Flow Time
- Minimizing maximum lateness in a flow shop subject to release dates
- Minimizing mean flow time with error constraint
- Minimizing total completion time for preemptive scheduling with release dates and deadline constraints
- Scheduling chains to minimize mean flow time
Cited in
(11)- Minimizing Schedule Length Subject to Minimum Flow Time
- Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines
- Mathematical programming formulations for machine scheduling: A survey
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
- Minimizing mean flow time with release time constraint
- A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
- scientific article; zbMATH DE number 91757 (Why is no real title available?)
- Minimizing total completion time for preemptive scheduling with release dates and deadline constraints
- The complexity of mean flow time scheduling problems with release times
- Match-up scheduling under a machine breakdown
- Minimizing total flow time and total completion time with immediate dispatching
This page was built for publication: Minimizing Mean Flow Time With Release Time and Deadline Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4033756)
