Pages that link to "Item:Q1262204"
From MaRDI portal
The following pages link to Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem (Q1262204):
Displaying 15 items.
- Total completion time in a two-machine flowshop with deteriorating tasks (Q928678) (← links)
- Scheduling two agents with controllable processing times (Q976351) (← links)
- Minimizing mean flow time with parallel processors and resource constraints (Q1084859) (← links)
- Minimization of the makespan in a two-machine problem under given resource constraints (Q1296091) (← links)
- Job-shop scheduling with convex models of operations (Q1341401) (← links)
- A variant of the permutation flow shop model with variable processing times (Q1363747) (← links)
- Single-machine scheduling with resource-dependent processing times and multiple unavailability periods (Q2142677) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- Optimizing resource speed for two-stage real-time tasks (Q2362234) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
- Two-machine open shop problem with controllable processing times (Q2467128) (← links)
- Parallel machine scheduling with a convex resource consumption function (Q2491771) (← links)
- Two-machine flow shop scheduling with convex resource consumption functions (Q6097489) (← links)
