The following pages link to G. Moslehi (Q336391):
Displaying 22 items.
- Optimizing blocking flow shop scheduling problem with total completion time criterion (Q336393) (← links)
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
- A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties (Q339632) (← links)
- An optimal method for the preemptive job shop scheduling problem (Q502444) (← links)
- A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine (Q604766) (← links)
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem (Q630678) (← links)
- Scheduling linear deteriorating jobs to minimize the number of tardy jobs (Q693149) (← links)
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption (Q1652150) (← links)
- A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach (Q1699353) (← links)
- Mathematical models for preemptive shop scheduling problems (Q1762150) (← links)
- The re-planning and scheduling of surgical cases in the operating room department after block release time with resource rescheduling (Q1999394) (← links)
- The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale (Q2077944) (← links)
- New integer programming models for slab stack shuffling problems (Q2109751) (← links)
- A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering (Q2173057) (← links)
- Minimizing maximum earliness and number of tardy jobs in the single machine scheduling problem with availability constraint (Q2429001) (← links)
- Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness (Q2450493) (← links)
- A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert (Q2490218) (← links)
- Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert (Q2570803) (← links)
- Finding Pareto optima for maximum tardiness, maximum earliness and number of tardy jobs (Q2627310) (← links)
- The multiple container loading problem with loading docks (Q6146635) (← links)
- Two new mixed‐integer programming models for the integrated train formation and shipment path optimization problem (Q6179688) (← links)
- Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs (Q6491320) (← links)
