Pages that link to "Item:Q1917233"
From MaRDI portal
The following pages link to A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times (Q1917233):
Displaying 17 items.
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
- Single machine scheduling with resource dependent release times and processing times (Q704120) (← links)
- Decomposition algorithms for submodular optimization with applications to parallel machine scheduling with controllable processing times (Q747774) (← links)
- Bicriteria robotic cell scheduling (Q835626) (← links)
- Pre-emptive scheduling problems with controllable processing times (Q880501) (← links)
- Preemptive scheduling on uniform parallel machines with controllable job processing times (Q930610) (← links)
- Scheduling two agents with controllable processing times (Q976351) (← links)
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches (Q1754151) (← links)
- Solving multi-objective parallel machine scheduling problem by a modified NSGA-II (Q1788959) (← links)
- Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- A multi-objective optimization for preemptive identical parallel machines scheduling problem (Q2403115) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- A new bounding mechanism for the CNC machine scheduling problems with controllable processing times (Q2566700) (← links)
- Fast Divide-and-Conquer Algorithms for Preemptive Scheduling Problems with Controllable Processing Times – A Polymatroid Optimization Approach (Q3541133) (← links)
- A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times (Q5949906) (← links)
