Heuristic algorithms for a complex parallel machine scheduling problem (Q1022398): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10100-008-0066-y / rank
Normal rank
 
Property / cites work
 
Property / cites work: An exact algorithm for a single-vehicle routing problem with time windows and multiple routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing problem with time windows and a limited number of vehicles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling multiprocessor tasks -- An overview / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem with flexible time windows and traveling times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling on parallel identical machines to minimize total tardiness / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10100-008-0066-Y / rank
 
Normal rank

Latest revision as of 13:24, 10 December 2024

scientific article
Language Label Description Also known as
English
Heuristic algorithms for a complex parallel machine scheduling problem
scientific article

    Statements

    Identifiers