The following pages link to (Q3964013):
Displaying 32 items.
- Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106) (← links)
- New directions in scheduling theory (Q786649) (← links)
- A note on the flow time and the number of tardy jobs in stochastic open shops (Q796445) (← links)
- On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints (Q909452) (← links)
- Job oriented production scheduling (Q915631) (← links)
- Job scheduling to minimize expected weighted flowtime on uniform processors (Q1111928) (← links)
- Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival (Q1112720) (← links)
- Scheduling of design projects with uncertain number of iterations (Q1124816) (← links)
- Sequencing jobs on a single machine with a common due data and stochastic processing times (Q1179194) (← links)
- The processor minimization problem with independent waiting-time constraints (Q1318710) (← links)
- An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns (Q1598772) (← links)
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
- Some concepts of stability analysis in combinatorial optimization (Q1805456) (← links)
- A stochastic optimization approach for robot scheduling (Q1896448) (← links)
- Asymptotic optimality of statistical multiplexing in pipelined processing (Q1908671) (← links)
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090) (← links)
- Three-machine open shop with a bottleneck machine revisited (Q2061137) (← links)
- A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- A cyclical search for the two machine flow shop and open shop to minimise finishing time (Q2356124) (← links)
- Scheduling the two-machine open shop problem under resource constraints for setting the jobs (Q2449360) (← links)
- Three is easy, two is hard: Open shop sum-batch scheduling problem refined (Q2466597) (← links)
- A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures (Q2475628) (← links)
- Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops (Q2563865) (← links)
- Two-machine shop scheduling: Compromise between flexibility and makespan value (Q2566711) (← links)
- A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data (Q2643723) (← links)
- Stochastic scheduling problems I — General strategies (Q3216419) (← links)
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264) (← links)
- An FPTAS for scheduling with resource constraints (Q6047696) (← links)
- Reentrant open shop scheduling problem with time lags and no-wait constraints (Q6568390) (← links)
- Two-stage stochastic/robust scheduling based on permutable operation groups (Q6596975) (← links)
