scientific article; zbMATH DE number 1016640
From MaRDI portal
Publication:4338954
zbMath0873.90049MaRDI QIDQ4338954
No author found.
Publication date: 4 June 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stochastic schedulingqueueing networksparallel computationscommunication delaysmulti-armed banditcyclic schedulingdeadlinestochastic flow-shopprofile schedulingresource constraint project scheduling
Deterministic scheduling theory in operations research (90B35) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)
Related Items
General scheduling non-approximability results in presence of hierarchical communications, A hyper-heuristic selector algorithm for cloud computing scheduling based on workflow features, Solving a concrete sleepers production scheduling by genetic algorithms, Reconstructing binary matrices with timetabling constraints, An application of dynamic programming to assign pressing tanks at wineries, An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications., Application of an optimization problem in max-plus algebra to scheduling problems, Optimal parallel processing of random task graphs, Flexibility and decoupling in simple temporal networks, New MIP model for multiprocessor scheduling problem with communication delays, Optimal and heuristic solution methods for a multiprocessor machine scheduling problem, The job shop scheduling problem: Conventional and new solution techniques, A parametric critical path problem and an application for cyclic scheduling, Scheduling tasks and communications on a virtual distributed system, Dynamic scheduling of parallel computations, An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications, Linear and quadratic algorithms for scheduling chains and opposite chains, A survey of the state-of-the-art of common due date assignment and scheduling research, The convergence of stochastic algorithms solving flow shop scheduling, On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications
