Pages that link to "Item:Q2183852"
From MaRDI portal
The following pages link to A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times (Q2183852):
Displaying 10 items.
- An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports (Q2023947) (← links)
- Timetable coordination in a rail transit network with time-dependent passenger demand (Q2239858) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- Integrated proactive-reactive approach and a hybrid adaptive large neighborhood search algorithm for berth and quay crane scheduling under uncertain combination (Q2691472) (← links)
- Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint (Q6043112) (← links)
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← links)
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)
- Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen (Q6068710) (← links)
- Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)
- An adapted constraint-programming formulation of the resource-constrained project scheduling problem applied to the identical parallel machines group shop and mixed shop scheduling problems (Q6659821) (← links)
