Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop (Q2044553): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/s10288-020-00449-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3041020310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Part batching and scheduling in a flexible cell to minimize setup costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling on two-machine flowshop with machine-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot streaming with variable sublots: an integer programming formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot streaming with detached setups in three-machine flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Lot Streaming In Two-Machine Flow Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-stage, single-lot, lot streaming problem for a \(1+2\) hybrid flow shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Properties of Lot Streaming in a Flow Shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lot streaming in three-stage production processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing near optimal schedules for the flow-shop lot streaming problem with sublot-attached setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-shop batch scheduling with identical processing-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow shop scheduling with lot streaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching in single operation manufacturing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Lagrangean Techniques for Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Basic Techniques for Lot Streaming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a hybrid flowshop with batch production at the last stage / rank
 
Normal rank

Latest revision as of 09:36, 26 July 2024

scientific article
Language Label Description Also known as
English
Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop
scientific article

    Statements

    Dynamic programming algorithms and Lagrangian lower bounds for a discrete lot streaming problem in a two-machine flow shop (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 August 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    lot streaming
    0 references
    setup times
    0 references
    flow shop
    0 references
    total flow time
    0 references
    Lagrangian relaxation
    0 references
    dynamic programming
    0 references
    0 references
    0 references
    0 references