Pages that link to "Item:Q1860372"
From MaRDI portal
The following pages link to The complexity of two group scheduling problems (Q1860372):
Displaying 16 items.
- Minimizing the number of late jobs under the group technology assumption (Q1304380) (← links)
- Two-machine group scheduling problem with blocking and anticipatory setups (Q1309970) (← links)
- Two-machine flowshop group scheduling problem (Q1577379) (← links)
- Group technology approach to the open shop scheduling problem with batch setup times (Q1577474) (← links)
- Scheduling groups of unit length jobs on two identical parallel machines. (Q1606911) (← links)
- An introduction to multi-parameter complexity analysis of discrete problems (Q1772842) (← links)
- Two-machine shop scheduling problems with batch processing (Q1802481) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times (Q2285809) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Group scheduling on two cells with intercell movement (Q2563903) (← links)
- Two-machine shop scheduling: Compromise between flexibility and makespan value (Q2566711) (← links)
- Group scheduling in a two-stage flowshop (Q4656762) (← links)
- (Q4796706) (← links)
- Sequential-Merge Facets for Two-Dimensional Group Problems (Q5429255) (← links)
- Single machine scheduling with assignable due dates to minimize maximum and total late work (Q6167395) (← links)
