Scheduling with assignable due dates, two competing agents and late work related criteria
Copyright policy )Scheduling with assignable due dates, two competing agents and late work related criteria
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dynamic programming, SCHEDULING PROBLEM, Disjoint sets, Two-agent, Scheduling, Two agents, single machine, Work-related, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, late work, Job shop scheduling, Scheduling algorithms, Single- machines, Operations research and management science, Assignable due dates, Due dates, scheduling, Single machine, Key feature, Predefined sets, two-agent, assignable due dates, Late work
dynamic programming, SCHEDULING PROBLEM, Disjoint sets, Two-agent, Scheduling, Two agents, single machine, Work-related, QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány, late work, Job shop scheduling, Scheduling algorithms, Single- machines, Operations research and management science, Assignable due dates, Due dates, scheduling, Single machine, Key feature, Predefined sets, two-agent, assignable due dates, Late work
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).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!