A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (Q657253): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-009-0150-8 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081195398 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59902867 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on flow-shop and job-shop batch scheduling with identical processing-time jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with batch-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open-shop batch scheduling with identical jobs / 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: Minimizing flow-time on a single machine with integer batch sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-pass batching algorithms for the one-machine problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching and scheduling in a multi-machine flow shop / 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 polynomial algorithm for a one machine batching problem / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/scheduling/BruckerS11a / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-009-0150-8 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:02, 10 December 2024

scientific article
Language Label Description Also known as
English
A polynomial-time algorithm for a flow-shop batching problem with equal-length operations
scientific article

    Statements

    Identifiers