Pages that link to "Item:Q2282538"
From MaRDI portal
The following pages link to Machine scheduling with soft precedence constraints (Q2282538):
Displaying 7 items.
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← links)
- Bi-objective unrelated parallel machines scheduling problem with worker allocation and sequence dependent setup times considering machine eligibility and precedence constraints (Q2083384) (← links)
- A survey of job shop scheduling problem: the types and models (Q2146994) (← links)
- A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows (Q2147032) (← links)
- 0-1 mathematical programming models for flexible process planning (Q6112702) (← links)
- The synergistic effect of operational research and big data analytics in greening container terminal operations: a review and future directions (Q6113444) (← links)