scientific article
From MaRDI portal
Publication:3221735
zbMath0557.90044MaRDI QIDQ3221735
Alexander H. G. Rinnooy Kan, Jan Karel Lenstra
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityschedulingsequencinganalysiscombinatorial algorithmprobabilisticworst case analysisannotated bibliography
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 operations research and mathematical programming (90-02)
Related Items
A decomposition approach for a resource constrained scheduling problem ⋮ Scheduling tasks on two processors with deadlines and additional resources ⋮ A decomposition approach in a DSS for a resource constrained scheduling problem ⋮ Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan ⋮ A review of TSP based approaches for flowshop scheduling ⋮ Performance of scheduling algorithms for no-wait flowshops with parallel machines ⋮ Open shops with jobs overlap
