Pages that link to "Item:Q4859582"
From MaRDI portal
The following pages link to Minimizing the weighted sum of quadratic completion times on a single machine (Q4859582):
Displaying 14 items.
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties (Q339632) (← links)
- A scheduling problem with job values given as a power function of their completion times (Q954933) (← links)
- Solution of the generalized Townsend single machine scheduling model (Q1278202) (← links)
- Generalized pairwise interchanges and machine scheduling (Q1388824) (← links)
- An improved precedence rule for single machine sequencing problems with quadratic penalty (Q1580988) (← links)
- An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times (Q1644059) (← links)
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
- Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires (Q1959184) (← links)
- For the airplane refueling problem local precedence implies global precedence (Q2341094) (← links)
- The local-global conjecture for scheduling with non-linear cost (Q2400434) (← links)
- Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints (Q2450684) (← links)
- Solving a stochastic single machine problem with initial idle time and quadratic objective (Q2655649) (← links)
- Minimizing a Quadratic Cost Function of Waiting Times in Single-Machine Scheduling (Q4849293) (← links)
- Note: ?Simultaneous optimization of efficiency and performance balance measures in single-machine scheduling problems? (Q5688024) (← links)
