The following pages link to (Q4658190):
Displaying 50 items.
- State-dependent \(\mathrm{M}/\mathrm{G}/1\) queueing systems (Q257065) (← links)
- A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job (Q283266) (← links)
- Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
- Controlling the workload of M/G/1 queues via the \(q\)-policy (Q319160) (← links)
- The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation (Q322969) (← links)
- An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
- A mixed integer programming approach for the single machine problem with unequal release dates (Q337161) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
- Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime (Q341463) (← links)
- The robust (minmax regret) single machine scheduling with interval processing times and total weighted completion time objective (Q342174) (← links)
- On scheduling a multiclass queue with abandonments under general delay costs (Q352983) (← links)
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Problems and methods for multiproduct inventory control in production conditions (Q384682) (← links)
- Scheduling of computational processes in real-time distributed systems with uncertain task execution times (Q395470) (← links)
- Serial batch scheduling on uniform parallel machines to minimize total completion time (Q402366) (← links)
- Coordination mechanisms with hybrid local policies (Q408369) (← links)
- Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
- Real-time production planning and control system for job-shop manufacturing: a system dynamics analysis (Q421712) (← links)
- A note on minimizing the sum of quadratic completion times on two identical parallel machines (Q456107) (← links)
- Waiting time distributions in the accumulating priority queue (Q475115) (← links)
- Quality assessment of a multistage process in the case of continuous response functions from resource influences (Q499578) (← links)
- An FPTAS for the parallel two-stage flowshop problem (Q507441) (← links)
- Flowshop problem \(F2 \to D|v=1\), \(c\geq 1|C_{\max}\) revisited (Q515553) (← links)
- Waiting time distributions in the preemptive accumulating priority queue (Q518869) (← links)
- Scheduling linearly shortening jobs under precedence constraints (Q552447) (← links)
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- Foreword to the thematical issue devoted to the seventieth anniversary of Academician V. S. Tanaev (Q612200) (← links)
- Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates (Q632665) (← links)
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness (Q670790) (← links)
- Scheduling jobs with varying processing times (Q673617) (← links)
- Tradeoff between setup times and carrying costs for finished items (Q690011) (← links)
- Reexamination of processing time uncertainty (Q707112) (← links)
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
- Scheduling to minimize the maximum total completion time per machine (Q726222) (← links)
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results (Q744660) (← links)
- Models of central capacity and concurrency (Q762011) (← links)
- A model of fixed activation time scheduling (Q762013) (← links)
- Approximation ratio of LD algorithm for multi-processor scheduling and the Coffman-Sethi conjecture (Q783686) (← links)
- Effective optimization methods for single-machine scheduling (survey) (Q786645) (← links)
- New directions in scheduling theory (Q786649) (← links)
- The time spent in a dynamic job shop (Q794063) (← links)
- Mixing of non-preemptive and preemptive repeat priority disciplines (Q796442) (← links)
- Algorithms for two-machine flow-shop sequencing with precedence constraints (Q800822) (← links)
- Delay analysis of discrete-time priority queue with structured inputs (Q803673) (← links)
- A decomposition approach to multi-project scheduling (Q809877) (← links)
- On the consequences of information delays in the scheduling of semi-automated flexible machines (Q816786) (← links)
- Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
- Makespan distribution of permutation flowshop schedules (Q835630) (← links)
- Handling load with less stress (Q851238) (← links)
- Scheduling parallel CNC machines with time/cost trade-off considerations (Q875425) (← links)
