Pages that link to "Item:Q4935311"
From MaRDI portal
The following pages link to Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing (Q4935311):
Displaying 14 items.
- Linear programming-based algorithms for the minimum makespan high multiplicity jobshop problem (Q490324) (← links)
- An asymptotically optimal algorithm for large-scale mixed job shop scheduling to minimize the makespan (Q511693) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- Asymptotically optimal policy for stochastic job shop scheduling problem to minimize makespan (Q724743) (← links)
- Optimal flow control in acyclic networks with uncontrollable routings and precedence constraints (Q763409) (← links)
- Optimal control of a two-server flow-shop network (Q892910) (← links)
- An algorithm for the maximum revenue jobshop problem (Q958087) (← links)
- Optimal node visitation in acyclic stochastic digraphs with multi-threaded traversals and internal visitation requirements (Q977005) (← links)
- A push-pull queueing system (Q1870012) (← links)
- Asymptotic behavior of the processes describing some insurance models (Q2807804) (← links)
- Dynamics on Linear Influence Network Games Under Stochastic Environments (Q3179195) (← links)
- STEADY-STATE SCHEDULING ON HETEROGENEOUS CLUSTERS (Q5315921) (← links)
- Scheduling jobshops with some identical or similar jobs (Q5946718) (← links)
- A hybrid fluid master–apprentice evolutionary algorithm for large-scale multiplicity flexible job-shop scheduling with sequence-dependent set-up time (Q6495522) (← links)
