Pages that link to "Item:Q1410614"
From MaRDI portal
The following pages link to Job-shop scheduling with processing alternatives. (Q1410614):
Displaying 14 items.
- Production scheduling with alternative process plans (Q439374) (← links)
- Maximising the weighted number of activity execution modes in project planning (Q724006) (← links)
- A tabu search approach for scheduling hazmat shipments (Q856786) (← links)
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem (Q1011298) (← links)
- A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs (Q1631504) (← links)
- An effective heuristic algorithm for the partial shop scheduling problem (Q1652579) (← links)
- The job shop scheduling problem with convex costs (Q1754305) (← links)
- Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms (Q2146989) (← links)
- An enhanced genetic algorithm with an innovative encoding strategy for flexible job-shop scheduling with operation and processing flexibility (Q2244251) (← links)
- A sequencing approach for creating new train timetables (Q2267382) (← links)
- A disjunctive graph model and framework for constructing new train schedules (Q2379528) (← links)
- A research survey: review of flexible job shop scheduling techniques (Q2811943) (← links)
- An agent-based negotiation approach to integrate process planning and scheduling (Q5478844) (← links)
- A general efficient neighborhood structure framework for the job-shop and flexible job-shop scheduling problems (Q6096569) (← links)
