scientific article; zbMATH DE number 849179
From MaRDI portal
Publication:4865763
DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199509)42:6<935::AID-NAV3220420606>3.0.CO;2-D" /><935::AID-NAV3220420606>3.0.CO;2-D 10.1002/1520-6750(199509)42:6<935::AID-NAV3220420606>3.0.CO;2-DzbMath0841.90076MaRDI QIDQ4865763
Publication date: 28 February 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (10)
Makespan minimization subject to flowtime optimality on identical parallel machines ⋮ Makespan minimization for two parallel machines with an availability constraint ⋮ Worst-case performance analysis of some approximation algorithms for minimizing makespan and flowtime ⋮ An approximate decomposition algorithm for scheduling on parallel machines with heads and tails ⋮ Identical parallel machine scheduling with time-dependent processing times ⋮ Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system ⋮ Minimizing makespan subject to minimum flowtime on two identical parallel machines ⋮ Minimizing flowtime subject to optimal makespan on two identical parallel machines ⋮ Makespan minimization for parallel machines scheduling with multiple availability constraints ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems
Cites Work
This page was built for publication:
