The battery switching station scheduling problem (Q1939710): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2012.09.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005554273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling of Uniform Processor Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Minimum Cost Flow Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Scheduling with Due Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:32, 6 July 2024

scientific article
Language Label Description Also known as
English
The battery switching station scheduling problem
scientific article

    Statements