On-line scheduling with non-crossing constraints (Q957355): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.orl.2008.04.005 / rank
Normal rank
 
Property / author
 
Property / author: LeLe Zhang / rank
Normal rank
 
Property / author
 
Property / author: LeLe Zhang / rank
 
Normal rank
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.2008.04.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2106461756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crane scheduling with spatial constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm Theory - SWAT 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A <i>m</i>‐parallel crane scheduling problem with a non‐crossing constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crane scheduling with non-crossing constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Container terminal operation and operations research -- a classification and literature review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on identical machines: How good is LPT in an on-line setting? / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ORL.2008.04.005 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:06, 10 December 2024

scientific article
Language Label Description Also known as
English
On-line scheduling with non-crossing constraints
scientific article

    Statements

    Identifiers