A single machine batch scheduling problem with bounded batch size (Q2467253): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2006.01.052 / 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.ejor.2006.01.052 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046294860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling problems with setup times or costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduling of Products with Two Subassemblies on a Single Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching to Minimize Flow Times on One Machine / 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: Scheduling with batching: A review / 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 / DOI
 
Property / DOI: 10.1016/J.EJOR.2006.01.052 / rank
 
Normal rank

Latest revision as of 19:58, 18 December 2024

scientific article
Language Label Description Also known as
English
A single machine batch scheduling problem with bounded batch size
scientific article

    Statements

    Identifiers