Pages that link to "Item:Q3635130"
From MaRDI portal
The following pages link to A Fluid Heuristic for Minimizing Makespan in Job Shops (Q3635130):
Displaying 17 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)
- An algorithm for the maximum revenue jobshop problem (Q958087) (← links)
- A differential game formulation of a controlled network (Q967284) (← links)
- From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective (Q1600095) (← links)
- A push-pull queueing system (Q1870012) (← links)
- Large deviation asymptotics and control variates for simulating large functions (Q2494582) (← links)
- A heuristic for minimizing the expected makespan in two-machine flow shops with consistent coefficients of variation (Q2572847) (← links)
- Makespan minimization in job shops: a polynomial time approximation scheme (Q2819572) (← links)
- MINIMIZING MAKESPAN IN A MULTICLASS FLUID NETWORK WITH PARAMETER UNCERTAINTY (Q3183125) (← links)
- A Heuristic Solution Procedure to Minimize Makespan on a Single Machine with Non-linear Cost Functions (Q3974115) (← links)
- Dynamic Server Assignment in Multiclass Queues with Shifts, with Applications to Nurse Staffing in Emergency Departments (Q5031673) (← links)
- Scheduling jobshops with some identical or similar jobs (Q5946718) (← links)
- Applications of fluid models in service operations management (Q6163558) (← links)
- A hybrid fluid master–apprentice evolutionary algorithm for large-scale multiplicity flexible job-shop scheduling with sequence-dependent set-up time (Q6495522) (← links)
