Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C59 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6391370 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
parallel-batching scheduling | |||
Property / zbMATH Keywords: parallel-batching scheduling / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
incompatible job families | |||
Property / zbMATH Keywords: incompatible job families / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
rejection | |||
Property / zbMATH Keywords: rejection / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
approximation algorithm | |||
Property / zbMATH Keywords: approximation algorithm / rank | |||
Normal rank |
Revision as of 22:18, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Scheduling a bounded parallel-batching machine with incompatible job families and rejection |
scientific article |
Statements
Scheduling a bounded parallel-batching machine with incompatible job families and rejection (English)
0 references
27 January 2015
0 references
parallel-batching scheduling
0 references
incompatible job families
0 references
rejection
0 references
approximation algorithm
0 references