On single-machine scheduling without intermediate delays (Q955319): 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.dam.2008.03.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2011999391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling equal-length jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for scheduling chains on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach to early/tardy scheduling with release dates / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:41, 28 June 2024

scientific article
Language Label Description Also known as
English
On single-machine scheduling without intermediate delays
scientific article

    Statements