Scheduling in network flow shops
Copyright policy )Scheduling in network flow shops
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- St Petersburg University Russian Federation
- University of California, Los Angeles United States
Transportation, logistics and supply chain management, network flow shop, Deterministic scheduling theory in operations research, makespan, error bounds, static scheduling, cycle time, routing, average flow time, Deterministic network models in operations research, heuristic, Abstract computational complexity for mathematical programming problems
Transportation, logistics and supply chain management, network flow shop, Deterministic scheduling theory in operations research, makespan, error bounds, static scheduling, cycle time, routing, average flow time, Deterministic network models in operations research, heuristic, Abstract computational complexity for mathematical programming problems
citations The total number of citations received by all articles of the researcher of interest.0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!