Pages that link to "Item:Q3329199"
From MaRDI portal
The following pages link to Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs (Q3329199):
Displaying 14 items.
- A note on minimizing the sum of quadratic completion times on two identical parallel machines (Q456107) (← links)
- A job shop scheduling heuristic for varying reward structures (Q815476) (← links)
- Single machine scheduling under market uncertainty (Q856210) (← links)
- Optimal preemptive scheduling on uniform machines with discounted flowtime objectives (Q856258) (← links)
- Scheduling jobs on a single machine to maximize the total revenue of jobs (Q954056) (← links)
- A survey of algorithms for the single machine total weighted tardiness scheduling problem (Q1262207) (← links)
- An optimal sequence in multicharacteristic inspection (Q1263512) (← links)
- Minimizing non-decreasing separable objective functions for the unit-time open shop scheduling problem (Q1772847) (← links)
- Selecting the best choice in the full information group interview problem (Q1809843) (← links)
- Stochastic machine scheduling to minimize waiting time related objectives with emergency jobs (Q2321516) (← links)
- Optimal design of a multiservice system: The line-penalty problem (Q2367368) (← links)
- The list scheduling algorithm for scheduling unreliable jobs on two parallel machines (Q2448904) (← links)
- On index priority sequencing rules for scheduling with time-dependent job processing times (Q2450686) (← links)
- A note on the optimality of index priority rules for search and sequencing problems (Q5392799) (← links)
