The following pages link to Ammar Oulamara (Q856679):
Displaying 24 items.
- (Q765333) (redirect page) (← links)
- Scheduling an unbounded batching machine with job processing time compatibilities (Q765334) (← links)
- Makespan minimization in a no-wait flow shop problem with two batching machines (Q856680) (← links)
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
- Total completion time in a two-machine flowshop with deteriorating tasks (Q928678) (← links)
- Flowshop scheduling problem with a batching machine and task compatibilities (Q954038) (← links)
- Scheduling hybrid flowshop with parallel batching machines and compatibilities (Q1000991) (← links)
- Minimizing the number of stations and station activation costs for a production line (Q1652155) (← links)
- Maximizing the number of served requests in an online shared transport system by solving a dynamic DARP (Q1691655) (← links)
- Complexity of flow shop scheduling problems with transportation constraints (Q1887768) (← links)
- Two-machine flowshop scheduling problem with coupled-operations (Q2327688) (← links)
- Optimal testing and repairing a failed series system (Q2369986) (← links)
- Scheduling the two-machine open shop problem under resource constraints for setting the jobs (Q2449360) (← links)
- Permutation flowshop scheduling problems with maximal and minimal time lags (Q2581596) (← links)
- A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags (Q2627602) (← links)
- Scheduling: agreement graph vs resource constraints (Q2629638) (← links)
- The electric location-routing problem with heterogeneous fleet: formulation and Benders decomposition approach (Q2668681) (← links)
- (Q2784174) (← links)
- (Q2861568) (← links)
- No-Wait Scheduling Problems with Batching Machines (Q2958672) (← links)
- Permutation flow shops with exact time lags to minimise maximum lateness (Q3055251) (← links)
- Two-Agent Scheduling on an Unbounded Serial Batching Machine (Q3167645) (← links)
- Meeting Locations in Real-Time Ridesharing Problem: A Buckets Approach (Q5281604) (← links)
- Iterated Tabu Search for the Mix Fleet Vehicle Routing Problem with Heterogenous Electric Vehicles (Q5356970) (← links)
