Minimizing <i>L</i> <sub>max</sub> for the single machine scheduling problem with family set-ups (Q4671323): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4943562 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimizing maximum lateness with job families / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Single machine scheduling with batch set-up times to minimize maximum lateness / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Complexity of Scheduling with Batch Setup Times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank | |||
Normal rank |
Latest revision as of 10:31, 10 June 2024
scientific article; zbMATH DE number 2161418
Language | Label | Description | Also known as |
---|---|---|---|
English | Minimizing <i>L</i> <sub>max</sub> for the single machine scheduling problem with family set-ups |
scientific article; zbMATH DE number 2161418 |
Statements
Minimizing <i>L</i> <sub>max</sub> for the single machine scheduling problem with family set-ups (English)
0 references
26 April 2005
0 references