Pages that link to "Item:Q1310024"
From MaRDI portal
The following pages link to Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function (Q1310024):
Displaying 12 items.
- Scheduling two jobs with fixed and nonfixed routes (Q1316587) (← links)
- On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404) (← links)
- The two-machine open shop problem: To fit or not to fit, that is the question (Q1811630) (← links)
- NP-hardness of shop-scheduling problems with three jobs (Q1893158) (← links)
- Complexity of mixed shop scheduling problems: A survey (Q1969835) (← links)
- A PTAS for non-resumable open shop scheduling with an availability constraint (Q2125217) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037) (← links)
- The Open Shop Scheduling Problem (Q3304098) (← links)
- TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS (Q3751358) (← links)
- Reentrant open shop scheduling problem with time lags and no-wait constraints (Q6568390) (← links)