Unit-time scheduling problems with time dependent resources
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3737686 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A linear time algorithm for restricted bin packing and scheduling problems
- A preemptive open shop scheduling problem with one resource
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
- Integer Programming with a Fixed Number of Variables
- Minimizing the total completion time in a unit-time open shop with release times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- The complexity of satisfiability problems
- Two-Machine Open Shops with Renewable Resources
Cited in
(8)- Open shop scheduling problems with conflict graphs
- Scheduling the two-machine open shop problem under resource constraints for setting the jobs
- Scheduling activities with time-dependent durations and resource consumptions
- Four decades of research on the open-shop scheduling problem to minimize the makespan
- Optimizing resource-constrained project scheduling problem considering the reliability function
- scientific article; zbMATH DE number 4137525 (Why is no real title available?)
- Scheduling unit-time tasks in renewable resource constrained flowshops
- scientific article; zbMATH DE number 3894816 (Why is no real title available?)
This page was built for publication: Unit-time scheduling problems with time dependent resources
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q678109)