Pages that link to "Item:Q1600095"
From MaRDI portal
The following pages link to From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective (Q1600095):
Displaying 11 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)
- Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349) (← links)
- Exponential penalty function control of loss networks (Q1769408) (← links)
- Production planning with load dependent lead times: An update of research (Q2480264) (← links)
