scientific article; zbMATH DE number 1500536
From MaRDI portal
Publication:4501555
zbMath0962.68012MaRDI QIDQ4501555
M. I. Sviridenko, Klaus Jansen
Publication date: 4 September 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (13)
An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops ⋮ A new three-machine shop scheduling: complexity and approximation algorithm ⋮ A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops ⋮ Two-stage proportionate flexible flow shop to minimize the makespan ⋮ Two-stage open-shop scheduling with a two-machine flow shop as a stage: approximation algorithms and empirical experiments ⋮ A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan ⋮ An FPTAS for the parallel two-stage flowshop problem ⋮ Minimizing makespan in a two-stage hybrid flow shop scheduling problem with open shop in one stage ⋮ Approximation schemes for scheduling and covering on unrelated machines ⋮ An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop ⋮ A genetic algorithm for the proportionate multiprocessor open shop ⋮ Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop ⋮ A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
This page was built for publication:
