Pages that link to "Item:Q4427365"

The following pages link to Solving Parallel Machine Scheduling Problems by Column Generation (Q4427365):

Displaying 50 items.

• An accelerated branch-and-price algorithm for multiple-runway aircraft sequencing problems (Q319714) (← links)
• Optimal allocation of emergency medical resources in a mass casualty incident: patient prioritization by column generation (Q322947) (← links)
• An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
• A branch and price algorithm for the pharmacy duty scheduling problem (Q342397) (← links)
• Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
• Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
• A two-stage stochastic programming model for the parallel machine scheduling problem with machine capacity (Q547125) (← links)
• Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems (Q622134) (← links)
• On compact formulations for integer programs solved by column generation (Q817199) (← links)
• A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times (Q853028) (← links)
• Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080) (← links)
• A branch-and-price algorithm to solve the molten iron allocation problem in iron and steel industry (Q878576) (← links)
• A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates (Q941541) (← links)
• Group-scheduling problems in electronics manufacturing (Q964869) (← links)
• Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
• A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes (Q976033) (← links)
• Parallel machine scheduling with precedence constraints and setup times (Q991370) (← links)
• Optimal and heuristic solution methods for a multiprocessor machine scheduling problem (Q1017458) (← links)
• Solving a tactical operating room planning problem by a column-generation-based heuristic procedure with four criteria (Q1026554) (← links)
• Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
• An alternative framework to Lagrangian relaxation approach for job shop scheduling. (Q1399595) (← links)
• A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem (Q1610145) (← links)
• A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) (← links)
• Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines (Q1711446) (← links)
• Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← links)
• Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm (Q1725624) (← links)
• Minimizing the weighted number of tardy jobs on parallel processors (Q1887912) (← links)
• Truck scheduling in cross-docking terminals with fixed outbound departures (Q1944875) (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
• A branch and price algorithm for single-machine completion time variance (Q2003576) (← links)
• Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization (Q2029254) (← links)
• A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions (Q2029954) (← links)
• Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs (Q2140265) (← links)
• Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270) (← links)
• Scheduling with divisible jobs and subcontracting option (Q2147141) (← links)
• A truncated column generation algorithm for the parallel batch scheduling problem to minimize total flow time (Q2184132) (← links)
• Identical parallel machine scheduling with assurance of maximum waiting time for an emergency job (Q2185530) (← links)
• Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network (Q2197321) (← links)
• On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
• Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria (Q2283297) (← links)
• A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003) (← links)
• Heuristics for online scheduling on identical parallel machines with two GoS levels (Q2320626) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Solving the selective multi-category parallel-servicing problem (Q2341388) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
• Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods (Q2430608) (← links)
• A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines (Q2485328) (← links)
• Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs (Q2566704) (← links)
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)