scientific article; zbMATH DE number 4137525
From MaRDI portal
Publication:3470246
Recommendations
- Scheduling unit-time tasks in renewable resource constrained flowshops
- Minimizing mean flow time with parallel processors and resource constraints
- Job shop scheduling with unit time operations under resource constraints and release dates
- Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
- Unit-time scheduling problems with time dependent resources
Cited in
(11)- Scheduling tasks on two processors with deadlines and additional resources
- Minimizing mean flow time with parallel processors and resource constraints
- Flow shop scheduling problem with conflict graphs
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- Flexible flow shop with dedicated buffers
- Scheduling unit-time tasks in renewable resource constrained flowshops
- Sequencing and scheduling in flowshops with task redistribution
- scientific article; zbMATH DE number 4185379 (Why is no real title available?)
- Unit-time scheduling problems with time dependent resources
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem
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 Q3470246)
