A branch and bound algorithm for the two-stage assembly scheduling problem (Q1280185): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Stage Assembly Scheduling Problem: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for single machine sequencing with deadlines to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Algorithm for the Total Weighted Tardiness Problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(96)00312-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088786941 / rank
 
Normal rank

Latest revision as of 08:26, 30 July 2024

scientific article
Language Label Description Also known as
English
A branch and bound algorithm for the two-stage assembly scheduling problem
scientific article

    Statements

    Identifiers