Scheduling multiple orders per job in a single machine to minimize total completion time (Q992578): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1016/j.ejor.2010.03.034 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994846011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analyses, linear programming and the bin-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple orders per job batch scheduling with incompatible jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column generation heuristics for multiple machine, multiple orders per job scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan with multiple-orders-per-job in a two-machine flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: On general routing problems / rank
 
Normal rank

Latest revision as of 03:46, 3 July 2024

scientific article
Language Label Description Also known as
English
Scheduling multiple orders per job in a single machine to minimize total completion time
scientific article

    Statements

    Identifiers