A branch and bound algorithm for the cyclic job-shop problem with transportation (Q339670): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2012.04.008 / 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.cor.2012.04.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005389774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic multiple-robot scheduling with time-window constraints using a critical path approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the cyclic job-shop problem with transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general model for cyclic machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic job shop scheduling problems with blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scheduling of material handling devices in a PCB production line: problem formulation and a polynomial algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Scheduling of Identical Parts in a Robotic Cell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in Robotic Cells: Classification, Two and Three Machine Cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of cyclic shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Study of a NP-hard cyclic scheduling problem: The recurrent job-shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using duplication for scheduling unitary tasks on m processors with unit communication delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3584178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for cyclic flowshop scheduling in a robotic cell / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Measures and Schedules in Periodic Job Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling large robotic cells without buffers / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2012.04.008 / rank
 
Normal rank

Latest revision as of 14:48, 9 December 2024

scientific article
Language Label Description Also known as
English
A branch and bound algorithm for the cyclic job-shop problem with transportation
scientific article

    Statements

    A branch and bound algorithm for the cyclic job-shop problem with transportation (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2016
    0 references
    cyclic job-shop
    0 references
    transport
    0 references
    blocking
    0 references
    branch and bound
    0 references
    minimal cycle time
    0 references

    Identifiers