Scheduling job families on non-identical parallel machines with time constraints (Q744650): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Scheduling jobs on parallel machines to minimize a regular step total cost function / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Mean Flow Time Minimization in Reentrant Job Shops with a Hub / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Re-entrant lines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Single-machine scheduling with advanced process control constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of scheduling job families about a common due date / rank | |||
Normal rank | |||
Revision as of 01:44, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling job families on non-identical parallel machines with time constraints |
scientific article |
Statements
Scheduling job families on non-identical parallel machines with time constraints (English)
0 references
26 September 2014
0 references
scheduling
0 references
parallel machines
0 references
time constraint
0 references
mixed integer linear programming
0 references
heuristics
0 references
semiconductor manufacturing
0 references
