scientific article
From MaRDI portal
Publication:3964013
zbMath0498.68022MaRDI QIDQ3964013
Linus Schrage, Michael L. Pinedo
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (31)
A PTAS for non-resumable open shop scheduling with an availability constraint ⋮ A stochastic optimization approach for robot scheduling ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Heuristic algorithms for the minmax regret flow-shop problem with interval processing times ⋮ A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data ⋮ Asymptotic optimality of statistical multiplexing in pipelined processing ⋮ Job scheduling to minimize expected weighted flowtime on uniform processors ⋮ Minimizing expected makespan in a two-machine stochastic open shop with Poisson arrival ⋮ Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass ⋮ Scheduling of design projects with uncertain number of iterations ⋮ Stochastic scheduling problems I — General strategies ⋮ An FPTAS for scheduling with resource constraints ⋮ Approximation algorithms for two-machine proportionate routing open shop on a tree ⋮ On the asymptotic probabilistic analysis of scheduling problems in the presence of precedence constraints ⋮ Job oriented production scheduling ⋮ Scheduling the two-machine open shop problem under resource constraints for setting the jobs ⋮ Sequencing jobs on a single machine with a common due data and stochastic processing times ⋮ Three is easy, two is hard: Open shop sum-batch scheduling problem refined ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures ⋮ Two-machine flow shop and open shop scheduling problems with a single maintenance window ⋮ Some concepts of stability analysis in combinatorial optimization ⋮ A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing ⋮ Three-machine open shop with a bottleneck machine revisited ⋮ Determining the optimal sequences and the distributional properties of their completion times in stochastic flow shops ⋮ Two-machine shop scheduling: Compromise between flexibility and makespan value ⋮ New directions in scheduling theory ⋮ A note on the flow time and the number of tardy jobs in stochastic open shops ⋮ An approach to solve the minimum expected makespan flow-shop problem subject to breakdowns ⋮ The processor minimization problem with independent waiting-time constraints ⋮ A cyclical search for the two machine flow shop and open shop to minimise finishing time
This page was built for publication:
