BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN (Q2931723): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiple-criterion model for machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / 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: Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DP algorithm for minimizing makespan and total completion time on a series-batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0217595914500250 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046112815 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:00, 30 July 2024

scientific article
Language Label Description Also known as
English
BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN
scientific article

    Statements

    Identifiers